The Feasible Region

Constraints as shapes

An interactive lesson with 6 steps, about 5 minutes: you predict, drag and solve, with instant feedback on every answer. It runs in your browser and needs JavaScript.

What you’ll learn

• Each constraint is an inequality: one side of a line.
• The feasible region is where all the constraints hold; it is always convex.
• Too many constraints can leave no feasible plan at all.

Steps

1. A bakery’s limits
2. Shaping the region
3. Possible or not?
4. All the cakes
5. A redundant rule
6. Impossible orders