PARIXO GATE · ME Open the app

GATE 2013 ME · Question 36

2 marksMultiple choiceIndustrial EngineeringLinear Programming and Simplex Method

A linear programming problem is shown below.

It has

  1. A

    an unbounded objective function.

  2. B

    exactly one optimal solution.

  3. C

    exactly two optimal solutions.

  4. D

    infinitely many optimal solutions.

GATE 2013 · Mechanical Engineering · IIT Bombay

Answer
(B)

From the official answer key published by IIT Bombay.

Worked solution

Consider the constraints and find the intercepts with the coordinate axes in the first quadrant ():
1. : intercepts are and .
2. : intercepts are and .

Since both intercepts of lie strictly inside those of ( and ), the first constraint is redundant and does not bind the feasible region.

The feasible region is bounded by the vertices:

Evaluating the objective function at these corner points:

  • At :
  • At :
  • At :

Even though the objective function is parallel to the redundant constraint , that constraint is inactive. The unique maximum occurs at . Hence, the problem has exactly one optimal solution.

Answer: (B) exactly one optimal solution.

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 2013 ME paper, IIT Bombay. Solutions by PARIXO AI. All 65 questions of this paper.