PARIXO GATE · ME Open the app

GATE 2024 ME · Question 39

2 marksMultiple choiceIndustrial EngineeringLinear Programming and Simplex Method

At the current basic feasible solution (bfs) (), the simplex method yields the following form of a linear programming problem in standard form.

Here the objective function is written as a function of the non-basic variables. If the simplex method moves to the adjacent bfs () that best improves the objective function, which of the following represents the objective function at , assuming that the objective function is written in the same manner as above?

  1. A

  2. B

  3. C

  4. D

GATE 2024 · Mechanical Engineering · IISc Bangalore

Answer
(A)

From the official answer key published by IISc Bangalore.

Worked solution

Given the objective to minimize with non-basic variables and .

1. Entering variable: The relative cost coefficient for is , which is more negative than that of (). Thus, enters the basis to achieve the best rate of improvement in .

2. Leaving variable: Using the minimum ratio test with :

The minimum non-negative ratio occurs for , so leaves the basis.

3. Updating the objective function:
From the row of the leaving variable :

Substituting into the objective function:

Answer: (A)

Practise Linear Programming and Simplex Method

14 GATE questions from this chapter, in short untimed sets, with the formula sheet beside them. Free.

More from Linear Programming and Simplex Method

Question from the official GATE 2024 ME paper, IISc Bangalore. Solutions by PARIXO AI. All 65 questions of this paper.