Q14: Maximum and minimum of at given corner points
The corner points of the feasible region in graphical representation of a L.P.P. are , and . If be the objective function, then
(A) Z is maximum at , minimum at
(B) Z is maximum at minimum at
(C) Z is maximum at , minimum at
(D) Z is maximum at , minimum at
Corner point method: find Z at each corner point.
Why?
By the corner point theorem, when has a maximum or a minimum over the feasible region, it occurs at a corner point. So we only need Z at the three corners.
Why?
Put x and y of each point into :
Comparing, .
Maximum at ; minimum at .
Why?
The largest corner value is the maximum and the smallest is the minimum.
Watch out: the point with the biggest coordinate is not automatically the maximum. has the largest y, but Z there is only 684.
Answer: (C) Z is maximum at , minimum at
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: The three corners are given, so go straight to one table: . The largest, 855 at , is the maximum and the smallest, 450 at , the minimum.
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Linear Programming in past papers: question 4 of 27 · see them all