The dual price for a

Question

The dual price for a < constraint A) will always be < 0. B) will always be > 0. C) will be < 0 in a minimization problem and > 0 in a maximization problem. D) will always equal 0.

Quizplus · Accepted Answer

The dual price, or shadow price, for a "<" constraint in a linear programming problem represents the increase in the objective function value per unit increase in the right-hand side of the constraint. It is positive in both minimization and maximization problems, indicating the potential benefit of relaxing the constraint.

​The Dual Price for a < Constraint

The Dual Price for a < Constraint