In an LPP, if the objective function \(Z=ax+by\) has the same maximum value at two corner points of the feasible region, then the number of points at which \(Z_{max}\) occurs is:
Answer & explanation
Correct answer: option 4
The correct answer is Option (4) → infinite
Let the maximum value M occur at the corner points \(P(x_1, y_1)\) and \(Q(x_2, y_2)\). Every point of the segment PQ can be written, for some \(0 \le t \le 1\), as
\(\big((1-t)x_1+tx_2,\ (1-t)y_1+ty_2\big)\)
Since Z is linear, its value there is
\(Z = (1-t)(ax_1+by_1)+t(ax_2+by_2)\)
\(= (1-t)M+tM = M\)
The feasible region is convex, so the whole segment PQ lies in it. Hence Z takes its maximum value M at every point of the segment joining the two corners, that is, at infinitely many points.
NCERT (2026-27 edition):
Graphical Method of Solving Linear Programming Problems
