Mechanical Engineering > GATE 2024 > Linear Programming
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.
minimize z = −x1 − 2x2
s.t. x3 = 2 + 2x1 − x2
x4 = 7 + x1 − 2x2
x5 = 3 − x1
x1, x2, x3, x4, x5 ≥ 0
Here the objective function is written as a function of the non-basic variables. If the simplex method moves to the adjacent bfs v1 (v1 ∈ ℝ5) that best improves the objective function, which of the following represents the objective function at v1, assuming that the objective function is written in the same manner as above?
minimize z = −x1 − 2x2
s.t. x3 = 2 + 2x1 − x2
x4 = 7 + x1 − 2x2
x5 = 3 − x1
x1, x2, x3, x4, x5 ≥ 0
Here the objective function is written as a function of the non-basic variables. If the simplex method moves to the adjacent bfs v1 (v1 ∈ ℝ5) that best improves the objective function, which of the following represents the objective function at v1, assuming that the objective function is written in the same manner as above?
Correct : b
Similar Questions
Which one of the options given represents the feasible region of the linear programming model: Maximize
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...
Consider an objective function Z(x1, x2) = 3x1 + 9x2 and the constraints
x1 + x2 ≤ 8,
x1 + 2x2 ≤ 4,
x1 ≥ 0, x2 ≥ 0.
The maximum value of the objective f...
Total Unique Visitors
Loading......