in Numerical Methods recategorized by
0 votes
0 votes

Maximize $Z = 15X_1 + 20X_2$ subject to $$\begin{array}{l} 12X_1 + 4X_2 \geq  36 \\ 12X_1 − 6X_2 \leq 24 \\ X_1, X_2 \geq 0 \end{array}$$
The above linear programming problem has

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

Please log in or register to answer this question.

Answer:

Related questions