The corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let \(Z=px+qy\), where p, q > 0, be the objective function. Then the condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is:
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → \(p=\displaystyle\frac{q}{2}\)
If the minimum occurs at both (3, 0) and (1, 1), Z must have the same value at these two corners:
\(Z(3, 0) = 3p\)
\(Z(1, 1) = p+q\)
\(3p = p+q\)
\(2p = q\)
\( \displaystyle p = \frac{q}{2} \)
Check: with q = 2p, Z(0, 3) = 3q = 6p, which is larger than 3p since p > 0. So 3p is indeed the minimum.
NCERT Exemplar:
Linear Programming
