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
retagged by

Please log in or register to answer this question.

Answer:

Related questions

0 answers
0 votes
Arjun asked Feb 19, 2017
Consider an objective function $Z(x_1,x_2)=3x_1+9x_2$ and the constraints$x_1+x_2 \leq 8$$x_1+2x_2 \leq 4$$x_1 \geq 0$ , $x_2 \geq 0$The maximum value of the objective...
0 answers
0 votes
Arjun asked Feb 24, 2017
Newton-Raphson method is used to find the roots of the equation, $x^3+3x^2+3x-1=0$. If the initial guess is $x_0=1$, then the value of $x$ after $2^{nd}$ iteration is ___...
0 answers
0 votes
Arjun asked Feb 24, 2017
Using a unit step size, the value of integral $\int_{1}^{2}x \ln x dx$ by trapezoidal rule is ________
0 answers
0 votes
Arjun asked Feb 17, 2018
The problem of maximizing $z=x_1-x_2$ subject to constraints $x_1+x_2 \leq 10, \: x_1 \geq 0, x_2 \geq 0$ and $x_2 \leq 5$ hasno solutionone solutiontwo solutionsmore tha...