GATE 2018 ME Set 2 · Question 45
The problem of maximizing subject to constraints , , and has
- A
no solution
- B
one solution
- C
two solutions
- D
more than two solutions
GATE 2018 · Mechanical Engineering · Set 2 · IIT Guwahati · printed as Q.35 in the ME section
Answer
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
- GATE 2017 ME Set 1 · Q51Two models, P and Q, of a product earn profits of Rs. 100 and Rs. 80 per piece, respectively. Production…
- GATE 2017 ME Set 2 · Q51Maximize Z = 5x1 + 3x2, subject to x1 + 2x2 ≤ 10, x1 - x2 ≤ 8, x1, x2 ≥ 0. In the starting Simplex tableau,…
- GATE 2016 ME Set 1 · Q65Maximize Z = 15X1 + 20X2 subject to 12X1 + 4X2 ≥ 36 12X1 - 6X2 ≤ 24 X1, X2 ≥ 0 The above linear programming…
- GATE 2016 ME Set 3 · Q65A firm uses a turning center, a milling center and a grinding machine to produce two parts. The table below…
- GATE 2015 ME Set 3 · Q61For the linear programming problem: arrayll Maximize Z = 3X1 + 2X2 Subject to -2X1 + 3X2 ≤ 9 X1 - 5X2 ≥ -20…
- GATE 2014 ME Set 3 · Q49Consider an objective function Z(x1, x2) = 3x1 + 9x2 and the constraints x1 + x2 ≤ 8, x1 + 2x2 ≤ 4, x1 ≥ 0,…
Question from the official GATE 2018 ME paper (Set 2), IIT Guwahati. Solutions by PARIXO AI. All 65 questions of this paper.