In a minimization linear programming problem, the ____ variables are subtracted from the greater than or equal to ($\ge$ ) inequality constraints in order to convert these constraints to equalities.
A) dual
B) primal
C) surplus
D) both a and b
E) both a and c

Question

Quizplus · Accepted Answer

Surplus variables are subtracted from the greater than or equal to inequality constraints in a minimization linear programming problem to convert these constraints into equalities.

In a Minimization Linear Programming Problem, the ____ Variables Are ≥\ge≥

In a Minimization Linear Programming Problem, the ____ Variables Are $\ge$