Match List-I with List-II.
| List-I | List-II |
| (A) Corner points of the feasible region for a LPP are (0, 0), (0, 3), (4, 0). The maximum value of objective function \(z=3x+5y\) is | (I) 0 |
| (B) Corner points of the feasible region for a LPP are (0, 0), (2, 4), (3, 0), (5, 2). The minimum value of objective function \(z=x+6y\) is | (II) 4 |
| (C) Corner points of the feasible region for a LPP are (0, 0), (0, 5), (7, 0), (2, 3). The maximum value of objective function \(z=10x+30y\) is | (III) 15 |
| (D) Corner points of the feasible region for a LPP are (1, 0), (0, 1), (2, 4), (3, 2). The minimum value of objective function \(z=6x+4y\) is | (IV) 150 |
Choose the correct answer from the options given below :
Answer & explanation
Correct answer: option 4
The correct answer is Option (4) → (A)-(III), (B)-(I), (C)-(IV), (D)-(II)
By the corner point method, the maximum or minimum of z over a bounded feasible region is the largest or smallest of its values at the corner points.
(A) Maximum of \(z = 3x + 5y\) at (0, 0), (0, 3), (4, 0)
This matches (III) 15
\(z(0, 0) = 0,\quad z(0, 3) = 15,\quad z(4, 0) = 12\)
(B) Minimum of \(z = x + 6y\) at (0, 0), (2, 4), (3, 0), (5, 2)
This matches (I) 0
\(z(0, 0) = 0,\quad z(2, 4) = 26,\quad z(3, 0) = 3,\quad z(5, 2) = 17\)
(C) Maximum of \(z = 10x + 30y\) at (0, 0), (0, 5), (7, 0), (2, 3)
This matches (IV) 150
\(z(0, 0) = 0,\quad z(0, 5) = 150,\quad z(7, 0) = 70,\quad z(2, 3) = 110\)
(D) Minimum of \(z = 6x + 4y\) at (1, 0), (0, 1), (2, 4), (3, 2)
This matches (II) 4
\(z(1, 0) = 6,\quad z(0, 1) = 4,\quad z(2, 4) = 28,\quad z(3, 2) = 26\)