2 votes

The following Linear Programming problem has:

$\text{Max} \quad Z=x_1+x_2$

Subject to $\quad x_1-x_2 \geq 0$

$\quad \quad \quad 3x_1 - x_2 \leq -3$

$\text{and} \quad x_1 , x_2 \geq 0 $

- Feasible solution
- No feasible solution
- Unbounded solution
- Single point as solution