Consider the Linear Programming Problem (LPP):
Maximize z = 2x + y
subject to the constraints:
3x - 7y ≤ 21
y - 2x ≤ 10
x, y ≥ 0. Then
1
The LPP admits a unique solution with an optimal value of Z.
2
The LPP is unbounded
3
The LPP admits infinite number of feasible solution with same optimal value of Z.
4
The LPP admits no feasible solution