Question
Consider two problem: (1) a minimization problem Z = x1 + 2x2 subject to:
−x1 + x2 ≥ 2 ; x1 + 2x2 ≥ 8; x1 ≥ 6 ; and x1, x2 ≥ 0 and (2) a maximization problem
of Z = x1 + 2x2 subject to: −x1 + x2 ≥ 2; 2x2 ≥ 8; x1, x2 ≥ 0. The minimization
problem has ............... and the maximization problem has .........................
1 multiple optimal solutions; unbounded feasible region
2 no feasible solution; multiple optimal solutions
3 no feasible solution; unique optimal solution
4 no feasible solution; unbounded feasible region
5 unique optimal solution; unbounded feasible region
Dr. Habyarimana Jean Baptiste, PhD
AST3231 Operations Research – Topic 2 – Linear Pr
−x1 + x2 ≥ 2 ; x1 + 2x2 ≥ 8; x1 ≥ 6 ; and x1, x2 ≥ 0 and (2) a maximization problem
of Z = x1 + 2x2 subject to: −x1 + x2 ≥ 2; 2x2 ≥ 8; x1, x2 ≥ 0. The minimization
problem has ............... and the maximization problem has .........................
1 multiple optimal solutions; unbounded feasible region
2 no feasible solution; multiple optimal solutions
3 no feasible solution; unique optimal solution
4 no feasible solution; unbounded feasible region
5 unique optimal solution; unbounded feasible region
Dr. Habyarimana Jean Baptiste, PhD
AST3231 Operations Research – Topic 2 – Linear Pr
Answers
There are no human answers yet.
Answered by
GPT 3.5
5 unique optimal solution; unbounded feasible region
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.