search
Log In
0 votes
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 function is _______
in Numerical Methods 24.6k points
retagged by

Please log in or register to answer this question.

Answer:

Related questions

0 votes
0 answers
Maximise $Z=5x_{1}+3x_{2}$ subject to $\begin{array}{} x_{1}+2x_{2} \leq 10, \\ x_{1}-x_{2} \leq 8, \\ x_{1}, x_{2} \geq 0 \end{array}$ In the starting Simplex tableau, $x_{1}$ and $x_{2}$ are non-basic variables and the value of $Z$ is zero. The value of $Z$ in the next Simplex tableau is _______.
asked Feb 27, 2017 in Numerical Methods Arjun 24.6k points
0 votes
0 answers
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 unbounded solution infeasible solution alternative optimum solution degenerate solution
asked Feb 24, 2017 in Numerical Methods Arjun 24.6k points
0 votes
0 answers
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$ has no solution one solution two solutions more than two solutions
asked Feb 17, 2018 in Numerical Methods Arjun 24.6k points
...