In Solving a Linear Programming Minimization Problem Using the Simplex

Multiple Choice

In solving a linear programming minimization problem using the simplex method,

A) every time an artificial variable is added,a surplus variable must also be added.
B) every time an artificial variable is added,a surplus variable must be subtracted.
C) every time a surplus variable is added,an artificial variable must be added.
D) every time a surplus variable is added,an artificial variable must be subtracted.
E) every time a surplus variable is subtracted,an artificial variable must be added.