Consider the LPP, with objective function optimize \(Z=2x-y+5\) subject to constraints \(3x+4y \le 60;\ x+3y \le 30,\ x, y \ge 0\). If the corner points of feasible region are A(0, 10), B(12, 6), C(20, 0) and O(0, 0), then
Match List I with List II
| List I | List II |
| A. Minimum value of Z | I. 45 |
| B. Maximum value of Z | II. 50 |
| C. The sum of maximum and minimum value of Z | III. −5 |
| D. Maximum of Z − Minimum of Z | IV. 40 |
Choose the correct answer from the options given below :
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → A-III, B-I, C-IV, D-II
The feasible region is bounded, so by the corner point method the maximum and the minimum of Z occur at corner points. Values of Z = 2x − y + 5:
\(A(0, 10): 0 - 10 + 5 = -5\)
\(B(12, 6): 24 - 6 + 5 = 23\)
\(C(20, 0): 40 - 0 + 5 = 45\)
\(O(0, 0): 0 - 0 + 5 = 5\)
A. Minimum value of Z
This matches III. −5.
\(\text{smallest corner value} = -5 \text{ at } A(0, 10)\)
B. Maximum value of Z
This matches I. 45.
\(\text{largest corner value} = 45 \text{ at } C(20, 0)\)
C. The sum of maximum and minimum value of Z
This matches IV. 40.
\(45 + (-5) = 40\)
D. Maximum of Z − Minimum of Z
This matches II. 50.
\(45 - (-5) = 50\)