Binding Constraint definition
An inequality constraint is binding at a feasible point when the point makes the inequality an equality.
Binding Constraint in a picture
How it works
For a limit a ≤ b, the constraint binds when a = b, so the slack b − a is zero. A binding constraint is also called active. Which constraints bind depends on the point you examine.
Worked examples
Is x + y ≤ 10 binding at (4, 6)?
Yes. The sum is exactly 10.
Is it binding at (4, 5)?
No. The sum is 9, leaving slack 1.
Can two bounds bind at the same feasible point?
Yes. At (4, 3), both x ≤ 4 and y ≤ 3 bind.
Common mistake
Check binding at a particular feasible point. A constraint can be binding at one point and have positive slack at another.
Quick check
Does x = 3 make x ≤ 8 binding?
Show answer
No. There is slack 5.
What word is another name for a binding constraint?
Show answer
Active.
Sources
Flashcard
Binding Constraint
Reveal the definition
An inequality constraint is binding at a feasible point when the point makes the inequality an equality.
Effortless Math. “Binding Constraint.” Math Dictionary.
