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

Question

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

Quizplus · Accepted Answer

The third constraint $\mathrm{X}_1 \le 1$ is redundant because it is dominated by the first constraint $\mathrm{X}_1 \le 2$. Therefore, the model has a redundant constraint.

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

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