The corner points of the feasible region of an LPP are (0, 0), (30, 0), (20, 30) and (0, 50). If the objective function maximize (z) = ax + by, where \(a \ne b\) and \(a, b \gt 0\), has alternate optimal solutions, then
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → \(a = 3b\)
The maximum of z is reached at a corner point. There are alternate optimal solutions when the maximum value is reached at two adjacent corners, because then every point of the edge joining them is also optimal.
Values of z = ax + by at the corners:
\(z(0, 0) = 0\)
\(z(30, 0) = 30a\)
\(z(20, 30) = 20a + 30b\)
\(z(0, 50) = 50b\)
Since a, b > 0, the maximum cannot be on the two edges through the origin. The two possible edges are the ones meeting at (20, 30).
Edge from (30, 0) to (20, 30):
\(30a = 20a + 30b\)
\(10a = 30b\)
\(a = 3b\)
Then z = 90b at both corners, which is more than z = 50b at (0, 50), so this common value is the maximum.
Edge from (20, 30) to (0, 50):
\(20a + 30b = 50b\)
\(a = b\)
This is ruled out by the condition \(a \ne b\). So \(a = 3b\).