Mechanical Engineering > GATE 2017 SET-2 > Linear Programming
Maximize Z = 5x1 + 3x2,
subject to
x1 + 2x2 ≤ 10
x1 - x2 ≤ 8
x1, x2 ≥ 0
In the starting Simplex tableau, x1 and x2 are non-basic variables and the value of Z is zero. The value of Z in the next Simplex tableau is ________.

Correct : 40

Similar Questions

At the current basic feasible solution (bfs) v0 (v0 ∈ ℝ5), the simplex method yields the following form of a linear programming problem in standard form. min...
#196 MCQ
Which one of the options given represents the feasible region of the linear programming model: Maximize
#227 MCQ
A manufacturing unit produces two products P1 and P2. For each piece of P1 and P2, the table below provides quantities of materials M1, M2, and M3 required, a...
#361 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......