Question 141 markMCQMedium
The shaded region in the figure is the feasible region of a linear programming problem. It is bounded by the coordinate axes and the lines , and .

At which point does attain its maximum value on this region?
Confirming your payment
Practice Questions · Question 14 of 30
The shaded region in the figure is the feasible region of a linear programming problem. It is bounded by the coordinate axes and the lines , and .

At which point does attain its maximum value on this region?
(A)
(B)
(C)
(D)
Option (D) is correct.
By Theorem 1, the maximum of occurs at a corner point of the feasible region. A corner point is a point of the region at which two boundary lines meet, so first find the five corners.
| Corner point | |
|---|---|
| (largest) | |
The region is bounded, so by Theorem 2 the largest corner value is the maximum: at .
Why the other options are wrong