PARIXO GATE · ME Open the app

GATE 2016 ME Set 1 · Question 65

2 marksMultiple choiceIndustrial EngineeringLinear Programming and Simplex Method

Maximize

subject to


The above linear programming problem has

  1. A

    infeasible solution

  2. B

    unbounded solution

  3. C

    alternative optimum solutions

  4. D

    degenerate solution

GATE 2016 · Mechanical Engineering · Set 1 · IISc Bangalore · printed as Q.55 in the ME section

Answer
(B)

From the official answer key published by IISc Bangalore.

Worked solution

To determine the nature of the solution, we analyze the constraints in the first quadrant ():

1. First constraint:

  • The boundary line passes through and , and the feasible region lies above this line.

2. Second constraint:

  • The boundary line passes through and , and the feasible region lies above this line.

Both constraints require to be greater than or equal to a linear function of . Thus, for any value of , can be chosen arbitrarily large such that:

Since the objective is to maximize and both coefficients are positive, taking yields within the feasible region. Therefore, the problem has an unbounded solution.

Answer: (B) 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 2016 ME paper (Set 1), IISc Bangalore. Solutions by PARIXO AI. All 65 questions of this paper.