At the current basic feasible solution (bfs) ν
0 (ν
0 ∈
R5), the simplex method yields the following form of a linear programming problem in standard form.
minimize z = -x
1 - 2x
2s.t. x
3 = 2 + 2x
1 - x
2x
4 = 7+x
1-2x
2x
5 = 3-x
1x
1, x
2, x
3, x
4, x
5 ≥ 0
Here the objective function is written as a function of the non-basic variables. If the simplex method moves to the adjacent bfs v
1 (v
1 ∈
R5) that best improves the objective function, which of the following represents the objective function at v
1, assuming that the objective function is written in the same manner as above?