Option (C) is correct.
Assertion (A). At the corner points, Z=2x+5y takes the values
| Corner point | Z=2x+5y |
|---|
| (0,6) | 30 |
| (4,2) | 18 (smallest) |
| (12,0) | 24 |
The region R is unbounded: it runs on indefinitely to the right and upwards. So by the Corner Point Method, 18 is the minimum only if the open half plane 2x+5y<18 has no point in common with R. Every point of R satisfies
2x+5y=(x+y)+(x+4y)≥6+12=18
So no point of R lies in 2x+5y<18, and the minimum of Z is 18, attained at (4,2). (A) is true.
Reason (R). This statement is false. On an unbounded region, the smallest corner value is only a candidate, and the half-plane test can reject it. Take Z=x−y on this same region R. Its corner values are −6 at (0,6), 2 at (4,2) and 12 at (12,0), so the smallest is −6. But (0,10) lies in R (since 0+10≥6 and 0+40≥12) and gives Z=−10<−6. So Z=x−y has no minimum on R at all. Example 4 of the textbook makes the same point: there the smallest corner value is −300, yet Z=−50x+20y has no minimum. (R) is false.
Why the other options are wrong
- (A) and (B) both need (R) to be true, and it is not.
- (D) says (A) is false, but the inequality above proves that 18 is the minimum.
Note that (A) is true for a different reason than (R) claims: what settles it is the half-plane check, not a general rule about corner values.