PARIXO GATE · ME Open the app

GATE 2018 ME Set 2 · Question 45

2 marksMultiple choiceIndustrial EngineeringLinear Programming and Simplex Method

The problem of maximizing subject to constraints , , and has

  1. A

    no solution

  2. B

    one solution

  3. C

    two solutions

  4. D

    more than two solutions

GATE 2018 · Mechanical Engineering · Set 2 · IIT Guwahati · printed as Q.35 in the ME section

Answer
(B)

From the official answer key published by IIT Guwahati.

Worked solution

The given linear programming problem is:

subject to:

The corner points of the bounded feasible region in the plane are:
1.
2.
3.
4.

The maximum value of is , which occurs uniquely at the extreme point . Because the gradient of the objective function vector is not orthogonal to any of the bounding constraint edges, there is no alternate optimal edge. Thus, the problem has a unique optimal solution.

Answer: (B) one 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 2018 ME paper (Set 2), IIT Guwahati. Solutions by PARIXO AI. All 65 questions of this paper.