Consider the following linear programming model:
$$\begin{array} { l l }
\operatorname { Max } & \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \
\text { Subject to: } & \
& \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \leq 2 \
& \mathrm { X } _ { 1 } \geq 1 \
& \mathrm { X } _ { 2 } \geq 3 \
& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0
\end{array}$$
This linear programming model has:
A)alternate optimal solution
B)unbounded solution
C)redundant constraint
D)infeasible solution
E)unique solution

Question

Consider the following linear programming model:
$$\begin{array} { l l } 
\operatorname { Max } & \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \
\text { Subject to: } & \
& \mathrm { X } _ { 1 } + \mathrm { X } _ { 2 } \leq 2 \
& \mathrm { X } _ { 1 } \geq 1 \
& \mathrm { X } _ { 2 } \geq 3 \
& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0
\end{array}$$
This linear programming model has:
A)alternate optimal solution
B)unbounded solution
C)redundant constraint
D)infeasible solution
E)unique solution

Quizplus · Accepted Answer

The constraints $X_1 \geq 1$, $X_2 \geq 3$, and $X_1 + X_2 \leq 2$ cannot be satisfied simultaneously, making the problem infeasible.

Consider the Following Linear Programming Model This Linear Programming Model Has: A)alternate Optimal Solution B)unbounded Solution

Consider the Following Linear Programming Model This Linear Programming Model Has:
A)alternate Optimal Solution
B)unbounded Solution