GATE ME 2024 — Question 39

Operations ResearchSimplex methodMCQ2 marks · −2/3 if wrongHard

At the current basic feasible solution (bfs) \(\boldsymbol{v_0}\) (\(\boldsymbol{v_0} \in \mathbb{R}^5\)), the simplex method yields the following form of a linear programming problem in standard form.
\[\begin{aligned} &\textit{minimize}\ z = -x_1 - 2x_2\\ &\textit{s.t.}\quad x_3 = 2 + 2x_1 - x_2\\ &\qquad\ \ x_4 = 7 + x_1 - 2x_2\\ &\qquad\ \ x_5 = 3 - x_1\\ &\qquad\ \ x_1, x_2, x_3, x_4, x_5 \ge 0 \end{aligned}\]
Here the objective function is written as a function of the non-basic variables. If the simplex method moves to the adjacent bfs \(\boldsymbol{v_1}\) (\(\boldsymbol{v_1} \in \mathbb{R}^5\)) that best improves the objective function, which of the following represents the objective function at \(\boldsymbol{v_1}\), assuming that the objective function is written in the same manner as above?
  1. A
    \(z = -4 - 5x_1 + 2x_3\)
  2. B
    \(z = -3 + x_5 - 2x_2\)
  3. C
    \(z = -4 - 5x_1 + 2x_4\)
  4. D
    \(z = -6 - 5x_1 + 2x_3\)
Practise the full 2024 paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
Practise more on Simplex methodTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group