The corner points of the feasible region of a linear programming problem are , and . If is the objective function, then (maximum value of minimum value of ) is equal to:
- (A)40
- (B)96
- (C)120
- (D)144✓ Correct
Answer: (D)
Solution
Evaluate at each corner point.
:
:
:
Maximum , minimum .
Hence option (D).
:
:
:
Maximum , minimum .
Hence option (D).
CBSE Class 12 Board · 2023 · Single correct option