The corner points of the feasible region for an L.P.P. are (0, 10), (5, 5), (15, 15) and (0, 20). If the objective function is z = px + qy; p, q > 0, then the condition on p and q so that the maximum of z occurs at (15, 15) and (0, 20) is
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → q = 3p
The maximum occurs at both corners only if z has the same value at (15, 15) and (0, 20):
\( z(15, 15) = z(0, 20) \)
\( 15p + 15q = 20q \)
\( 15p = 5q \)
\( q = 3p \)
Check that this common value is the largest, with q = 3p and p > 0:
\( z(0, 10) = 10q = 30p \)
\( z(5, 5) = 5p + 5q = 20p \)
\( z(15, 15) = 15p + 45p = 60p \)
\( z(0, 20) = 20q = 60p \)
So 60p is the maximum, reached at (15, 15) and (0, 20) (and at every point of the edge joining them).
NCERT Exemplar:
Linear Programming
