Consider the Following Linear Programming Model This Linear Programming Model Has:
A)redundant Constraints
B)infeasible Solution
C)alternate

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 } + \mathrm { X } _ { 2 } \geq 4 \\& \mathrm { X } _ { 1 } \geq 2 \\& \mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0\end{array}$$
This linear programming model has:

A) redundant constraints
B) infeasible solution
C) alternate optimal solution
D) unique solution
E) unbounded solution