PARIXO GATE · ME Open the app

GATE 2015 ME Set 3 · Question 61

2 marksMultiple choiceIndustrial EngineeringLinear Programming and Simplex Method

For the linear programming problem:

The above problem has

  1. A

    unbounded solution

  2. B

    infeasible solution

  3. C

    alternative optimum solution

  4. D

    degenerate solution

GATE 2015 · Mechanical Engineering · Set 3 · IIT Kanpur

Answer
(A)

From the official answer key published by IIT Kanpur.

Worked solution

To solve the linear programming problem graphically, consider the constraints in the first quadrant ():
1. :
The boundary line passes through and . Testing gives (true), so the region lies below this line. As , can also increase up to .
2. , which is equivalent to :
The boundary line passes through and . Testing gives (true), so the region lies below this line.

In the first quadrant, both lines have positive slopes:


As , both constraints allow to grow indefinitely without an upper bound on (e.g., along the -axis where , both constraints and are satisfied for all ).
Since the objective is to maximize , we can choose and let , causing .
Thus, the problem has an unbounded solution.

Answer: (A) unbounded 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 2015 ME paper (Set 3), IIT Kanpur. Solutions by PARIXO AI. All 65 questions of this paper.