Consider the following linear programming problem:
Maximize z = 3x + 2y
s.t. 3x + 2y ≥ 15
2x + 3y ≤ 6
x ≥ 0, y ≥ 0
The above linear programming problem has
A. Unique optimal solution
B. Multiple optimal solution
C. Unbounded solution
D. Infeasible solution
Answer: Option D
Related Questions on Mine System Engineering
A. Unique optimal solution
B. Multiple optimal solution
C. Unbounded solution
D. Infeasible solution
Join The Discussion