In an LPP:
If two corner points yield the same maximum value of the objective function of an LPP, then:
(A) the LPP has unique solution
(B) the LPP has 2 solutions
(C) the LPP has 3 solutions
(D) the LPP has infinitely many solutions
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 1
The correct answer is Option (1) → (D) only
Let the corner points P and Q both give the maximum value M of the linear objective function z. A point R of the segment PQ is
\( R = (1-t)P+tQ,\quad 0 \le t \le 1 \)
Since z is linear:
\( z(R) = (1-t)\,z(P)+t\,z(Q) \)
\( = (1-t)M+tM = M \)
The segment PQ lies in the (convex) feasible region and has infinitely many points.
So every point of the segment joining the two corner points gives the maximum: the LPP has infinitely many optimal solutions.
Checking the statements
(A) the LPP has unique solution — Incorrect. The two corner points are already two different optimal solutions.
(B) the LPP has 2 solutions — Incorrect. Every point between the two corners is also optimal.
(C) the LPP has 3 solutions — Incorrect. Every point between the two corners is also optimal, not just three.
(D) the LPP has infinitely many solutions — Correct. All points of the segment joining the two corners are optimal.
NCERT (2026-27 edition):
Graphical Method of Solving Linear Programming Problems
