Consider the following Linear Programming Problem (LPP):
Maximize Z = 3x1 + 2x2 Subject to
x1 ≤ 4
x2 ≤ 6
3x1 + 2x2 ≤ 18
x1 ≥ 0, x2 ≥ 0
1
The LPP has a unique optimal solution
2
The LPP is infeasible
3
The LPP is unbounded
4
The LPP has multiple optimal solutions