The feasible region of a linear programming problem is given by , , , . Its corner points are and . Let .
Assertion (A): has no minimum value on .
Reason (R): The smallest value of at the corner points of is , and the open half-plane has no point in common with .
- (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.
