The feasible region of a linear programming problem is given by , , , . It is unbounded.
Assertion (A): No objective function , with and not both zero, can have both a maximum value and a minimum value on .
Reason (R): If the feasible region is unbounded, a maximum or a minimum value of may not exist; if it exists, it must occur at a corner point of the region.
- (A) Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).
- (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is NOT the correct explanation of Assertion (A).
- (C) Assertion (A) is true, but Reason (R) is false.
- (D) Assertion (A) is false, but Reason (R) is true.
