The feasible region of a linear programming problem is given by , , , . Its corner points are , and .
For the objective function , which of the following is true?
Confirming your payment
Practice Questions · Question 18 of 30
The feasible region of a linear programming problem is given by , , , . Its corner points are , and .
For the objective function , which of the following is true?
(A) has maximum value and no minimum value.
(B) has minimum value and no maximum value.
(C) has maximum value and minimum value .
(D) has neither a maximum nor a minimum value on .
Option (D) is correct.
Corner values.
| Corner point | |
|---|---|
| (smallest, ) | |
| (largest, ) |
The region is unbounded: any point with both and large satisfies both constraints. So and are only candidates, and each must pass the open-half-plane test.
Maximum. Is there a point of with ? Take . Here and , so it lies in , and . So has no maximum.
Minimum. Is there a point of with ? Take . Here and , so it lies in , and . So has no minimum.
Why the other options are wrong