The feasible region of a linear programming problem is given by
For which of the following objective functions is the maximum on attained only at and the minimum on attained only at ?
Confirming your payment
Competency-Based Questions (CBQ) · Question 67 of 80
The feasible region of a linear programming problem is given by
For which of the following objective functions is the maximum on attained only at and the minimum on attained only at ?
(A)
(B)
(C)
(D)
Option (A) is correct.
Corner points of . The line cuts the corner off the rectangle , , meeting the axes at and . So is the pentagon with corners
, , , , .
is bounded, so each objective has a maximum and a minimum at corners. A value is attained only at a corner when no other corner shares it.
| Corner | ||||
|---|---|---|---|---|
For the maximum occurs only at and the minimum occurs only at , as required.
(B) is wrong: has its maximum at , but its minimum is at , not at .
(C) is wrong: has minimum at both and , and so along the whole edge joining them on ; the minimum is not attained only at .
(D) is wrong: has its maximum at and its minimum at ; neither condition holds.
In general, for a maximum only at needs and , and a minimum only at needs and , i.e. . Of the four options only satisfies this (); fails because , and sits exactly on the boundary .