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

Multiple Choice

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