For an objective function \(z=ax+by\) where \(a, b \gt 0\). The corner points of feasible region determined by a set of constraints are (0, 20) (10, 10) (30, 30) and (0, 40). The condition on a and b such that max z occurs at both the points (30, 30) and (0, 40) is:
Answer & explanation
Correct answer: option 1
The correct answer is Option (1) → \(b-3a=0\)
If the maximum of z occurs at both (30, 30) and (0, 40), z must have the same value at both corners:
\(z(30, 30) = z(0, 40)\)
\(30a + 30b = 40b\)
\(30a = 10b\)
\(b - 3a = 0\)
This common value is indeed the maximum: with b = 3a,
\(z(0, 20) = 60a\)
\(z(10, 10) = 40a\)
\(z(30, 30) = 120a\)
\(z(0, 40) = 120a\)
Since a > 0, 120a is the largest value, so the maximum occurs at both (30, 30) and (0, 40).
NCERT Exemplar:
Linear Programming
