Register

GATE2017 ME-2: 51

• recategorized by
0 votes
0 votes
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 _______.
• recategorized by
User Avatar

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →
Answer:

Related questions

0 answers
0 votes
Arjun asked Feb 19, 2017
GATE Mechanical 2014 Set 3 | Question: 39
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 _______
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 17, 2018
GATE2018-2-35
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
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...
0 answers
0 votes
Arjun asked Feb 24, 2017
GATE2016-1-55
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 infeasible solution unbounded solution alternative optimum solutions degenerate solution
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 pr...
Voting & Accepting an answer helps improve the community
Link Copied!