Algebra

Binding Constraint

Students use the last available piece exactly, leaving a supply tray empty.

Binding Constraint definition

An inequality constraint is binding at a feasible point when the point makes the inequality an equality.

In Spanish
restricción activa
Topic
Optimization and constraints

Binding Constraint in a picture

Binding Constraint diagramAt x = 7, the bound x ≤ 7 is binding. At x = 5, the same bound has slack 2.Upper bound: x ≤ 7The most the variable may use is 7At x = 7: slack = 0The constraint binds hereAt x = 5: slack = 2The constraint has room here
At x = 7, the bound x ≤ 7 is binding. At x = 5, the same bound has slack 2.

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

What is the slack of a binding upper-bound constraint?

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.