The dual price for a

Question

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

Quizplus · Accepted Answer

The dual price for a less-than constraint in linear programming indicates how much the objective function value will improve if the right-hand side of the constraint is increased by one unit. Therefore, it is always greater than 0, as increasing the resource typically improves the objective value in both minimization and maximization problems.

The Dual Price for a < Constraint Will