In an LPP, if the objective function \(Z=x+2y\) has minimum value at two corner points (6, 0) and (0, 3) of the feasible region, then number of points when Z has minimum value is :
Answer & explanation
Correct answer: option 4
The correct answer is Option (4) → infinite
At the two corner points:
\(Z(6, 0) = 6 + 0 = 6\)
\(Z(0, 3) = 0 + 6 = 6\)
When two corner points give the same optimal value, every point of the segment joining them gives that value too. A point of the segment is
\((x, y) = (6\lambda,\ 3 - 3\lambda),\quad 0 \le \lambda \le 1\)
\(Z = 6\lambda + 2(3 - 3\lambda) = 6\)
The segment has infinitely many points, so Z has its minimum value at infinitely many points.