Q17: Maximum minus minimum of on a feasible region
The feasible region of a linear programming problem with objective function is shown below :
The maximum value of Z − minimum value of Z is
(A)
(B)
(C)
(D)
The corner points of the feasible region are , , and .
Why?
Corner point method: when the feasible region is bounded, the maximum and the minimum of both occur at corner points.
Read the corners from the figure: the origin, on the -axis, the marked point , and on the -axis.
Why?
Substitute each corner into :
The largest of 0, 14, 43, 35 is 43. The smallest is 0.
Maximum , minimum , so the difference is .
Why?
Watch out: the origin is a corner of the shaded region, so the minimum is 0. Missing it gives , option (B).
The question asks for maximum minus minimum, not for the maximum alone.
Answer: (D)
Chapter 12, Linear Programming: Corner point method.
Question type: Both maximum and minimum, and a tie along an edge
How to spot it: click to see
Type 3. Both maximum and minimum, and a tie along an edge
Spot it: "Minimise and maximise ". Often one rule, like , is a line through the origin.
Here: Read the corners off the graph: , , , . One table of gives both the maximum, 43, and the minimum, 0, so the difference is 43.
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Linear Programming in past papers: question 1 of 27 · see them all