Q4
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
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board