The dual price for an equality constraint is the z_j value for its artificial variable.

Question

Quizplus · Accepted Answer

This is true. When using the simplex method to solve a linear programming problem, artificial variables may be introduced in order to convert inequality constraints into equality constraints. The dual price for an equality constraint is the coefficient of the corresponding slack variable in the final tableau of the simplex method. When an artificial variable is used to convert an inequality into an equality constraint, its coefficient in the final tableau will be zero, and its dual price will be equal to the coefficient of the corresponding slack variable, which is equal to the z-value of the row containing the artificial variable (assuming maximization).

The Dual Price for an Equality Constraint Is the Zj

The Dual Price for an Equality Constraint Is the Z_j