in Numerical Methods retagged by
0 votes
0 votes

For the linear programming problem:

$$\begin{array}{ll} \text{Maximize}  & Z = 3X_1 + 2X_2 \\ \text{Subject to} &−2X_1 + 3X_2 \leq 9\\  & X_1 − 5 X_2 \geq −20   \\ & X_1, X_2 \geq 0 \end{array}$$ 

The above problem has

  1. unbounded solution
  2. infeasible solution
  3. alternative optimum solution
  4. degenerate solution
in Numerical Methods retagged by
by
27.4k points

Please log in or register to answer this question.

Answer:

Related questions