The corner points of the feasible region for an LPP 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 4
The correct answer is Option (4) → q = 3p
Values of Z = px + qy at the corners:
\(Z(0, 10) = 10q\)
\(Z(5, 5) = 5p + 5q\)
\(Z(15, 15) = 15p + 15q\)
\(Z(0, 20) = 20q\)
The maximum occurs at both (15, 15) and (0, 20), so Z must have the same value at these two corners:
\(15p + 15q = 20q\)
\(15p = 5q\)
\(q = 3p\)
This common value must also be the largest value of Z. With q = 3p (p > 0):
\(Z(15, 15) = Z(0, 20) = 60p\)
\(Z(0, 10) = 30p\)
\(Z(5, 5) = 20p\)
So 60p is the largest value, and the condition is q = 3p.
NCERT Exemplar:
Linear Programming
