At the current basic feasible solution (bfs) (), the simplex method yields the following form of a linear programming problem in standard form.
Here the objective function is written as a function of the non-basic variables. If the simplex method moves to the adjacent bfs () that best improves the objective function, which of the following represents the objective function at , assuming that the objective function is written in the same manner as above?
- A
- B
- C
- D

