1A. Constraints with slack or surplus in the linear programming solutions are called binding constraints. TRUE OR FALSE

1B. The shadow price, or dual price, of a constraint is an indication of the change in the optimized value of an objective function in a one unit change in a binding constraint. TRUE OR FALSE

1C. In a LP solution, constraints with slack are called ________ constraints.

• binding

• nonbinding

• surplus

• overage