The corner points of the feasible region for an L.P.P are (0, 4), (2, 3), (4, 5), (7, 0). If objective function is \(Z = px + qy\) ; \(p, q \gt 0\) then the condition on p and q so that the minimum of Z occurs at (2, 3) and (7, 0) is :
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → \(5p = 3q\)
When the minimum of Z occurs at two corner points, Z has the same value at both points (the minimum is then reached all along the edge joining them).
\(Z(2, 3) = 2p + 3q\)
\(Z(7, 0) = 7p\)
Equating the two values:
\(2p + 3q = 7p\)
\(3q = 5p\)
So the condition is \(5p = 3q\).
Note: It seems that there is a mistake in the original NTA paper, which prints corner points that cannot all be corners of one feasible region: the point (2, 3) lies inside the triangle formed by (0, 4), (4, 5) and (7, 0). Also, with \(5p = 3q\) the value of Z at (0, 4) is \(4q = \frac{20p}{3}\), which is less than \(7p\), the value at (2, 3) and (7, 0); so as printed the minimum would be at (0, 4). The question can still be solved by the intended method, because \(5p = 3q\) is the only option that gives Z the same value at (2, 3) and (7, 0).