Match List I with List II
| LIST I | LIST II |
| A. If the corner points of the feasible region for an LPP are (0, 4), (5, 0), (7, 9), then the minimum value of the objective function \(Z = 5x + 8y\) is, | I. 27 |
| B. If the corner points of the feasible region for an LPP are (0, 0), (0, 2), (3, 4), (5, 3), then the maximum value of the objective function \(Z = 3x + 4y\) | II. 60 |
| C. The corner points of the feasible region for an LPP are (0, 2), (1, 2), (4, 3), (7, 0). The objective function is \(Z = x + 5y\). Then (Max Z + Min Z) is, | III. 25 |
| D. If the corner points of the feasible region for an LPP are (0, 4), (3, 0), (3, 2), (6, 9). The objective function is \(Z = 2x + 6y\). Then (Max Z − Min Z) | IV. 26 |
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → A-III, B-I, C-IV, D-II
By the corner point method, the maximum and minimum of Z over a bounded feasible region occur at corner points, so Z is worked out at each corner.
(A) Minimum of \(Z = 5x + 8y\) at (0, 4), (5, 0), (7, 9)
This matches (III) 25.
\((0, 4): Z = 32\)
\((5, 0): Z = 25\)
\((7, 9): Z = 35 + 72 = 107\)
(B) Maximum of \(Z = 3x + 4y\) at (0, 0), (0, 2), (3, 4), (5, 3)
This matches (I) 27.
\((0, 0): Z = 0\)
\((0, 2): Z = 8\)
\((3, 4): Z = 9 + 16 = 25\)
\((5, 3): Z = 15 + 12 = 27\)
(C) Max Z + Min Z for \(Z = x + 5y\) at (0, 2), (1, 2), (4, 3), (7, 0)
This matches (IV) 26.
\((0, 2): Z = 10\)
\((1, 2): Z = 11\)
\((4, 3): Z = 4 + 15 = 19\)
\((7, 0): Z = 7\)
\(\text{Max } Z + \text{Min } Z = 19 + 7 = 26\)
(D) Max Z − Min Z for \(Z = 2x + 6y\) at (0, 4), (3, 0), (3, 2), (6, 9)
This matches (II) 60.
\((0, 4): Z = 24\)
\((3, 0): Z = 6\)
\((3, 2): Z = 6 + 12 = 18\)
\((6, 9): Z = 12 + 54 = 66\)
\(\text{Max } Z - \text{Min } Z = 66 - 6 = 60\)