Question

At the current basic feasible solution (bfs) ν0 (ν0 ∈ $\R^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 $\geq$ 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 ∈ $\R^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?

• A. z=-4-5x1 + 2x3
• B. z = -3+x5 - 2x2
• C. z=-4-5x1 + 2x4
• D. z = -6-5x1 + 2x3

Answer 1

Answer: (A)

z=-4-5x1 + 2x3

Answer 2

The correct option is (A): z=-4-5x1 + 2x3