Multiple Choice
For a maximization linear programming problem, a(n) ________ is ________ for a less-than-or-equal-to constraint.
A) surplus, subtracted
B) slack, added
C) artificial, added
D) artificial, subtracted
E) surplus, added
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q78: The linear programming problem whose output
Q79: In the simplex procedure, if it is
Q80: The variable with the largest positive <i>cj</i>
Q81: The theoretical limit on the number of
Q82: At the initial basic feasible solution at
Q84: Given the following linear programming problem:<br>
Q85: The simplex method moves from one better
Q86: _ variables are added to constraints and
Q87: In using the simplex method, the number
Q88: In the simplex method, the model is