Q11: Where is maximum on a bounded feasible region
For the linear programming problem (LPP), the objective function is and the feasible region determined by a set of constraints is shown in the graph:
(Note: The figure is not to scale.)
Which of the following statements is true?
(A) Maximum value of is at .
(B) Maximum value of is at .
(C) Value of at is less than the value at .
(D) The value of at is less than the value at .
The corner points of the feasible region are , , and .
Values of at the corner points:
Why?
Put each corner into . For example, at : and . At : . At : .
The feasible region is bounded, so the maximum value of is 180, at .
Why?
Corner point rule: on a bounded feasible region, has a maximum and a minimum, and each occurs at a corner point. So the largest of the four corner values is the maximum.
Watch out: has the largest , but gives the largest , because counts too.
So (A) is false. Also , so (C) is false, and , so (D) is false.
Answer: (B) Maximum value of is at .
Chapter 12, Linear Programming: LPP: maximum at a corner point.
Question type: Find the maximum
How to spot it: click to see
Type 1. Find the maximum: lines, shading, corners, table
Spot it: "Maximise " with "" rules that have only plus signs, like . The region is then a closed shape with a corner at the origin.
Here: The region OPQR has a corner at the origin and is bounded, so put the four corners into . The largest value, 180 at , is the maximum.
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Linear Programming in past papers: question 18 of 27 · see them all