In Solving a Linear Programming Minimization Problem Using the Simplex

question 35

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 be subtracted.
• B)every time a surplus variable is added, an artificial variable must be added.
• C)every time a surplus variable is added, an artificial variable must be subtracted.
• D)every time a surplus variable is subtracted, an artificial variable must be added.