Consider the following linear programming model:

Max

$2x_1+3x_2$

Subject to:

$x_{1}2$

$x_{2}3$

$x_{1}1$

$x_1,x_{2}0$

This linear programming model has:

unbounded solution

non$-$negative solution

infeasible solution

alternate optimal solutions

redundant constraint