Historical Context & Motivation
For thousands of years, people have faced the same basic challenge: how do you make the best possible decision when resources are limited? Ancient farmers had to decide how much land to plant with wheat versus barley, knowing they had only so many seeds, so many workers, and so many days before the rainy season. Ancient merchants needed to load cargo ships without exceeding weight limits while maximizing profit. These everyday problems are, at their core, constraint-based modeling problems — situations where you must find the best outcome while staying within a set of rules or limits.
The central question this lesson addresses is straightforward but powerful: when you face a real-world situation with multiple limits — on money, time, materials, nutrition, or anything else — how do you translate those limits into mathematical language, and then how do you figure out which solutions are actually realistic? That skill is exactly what CCSS.A-CED.3 asks you to master.
Core Principles & Definitions
Before diving into problems, you need a clear understanding of the vocabulary and ideas that make constraint modeling work. The process always follows the same pattern: identify the quantities you can control (your variables), identify the rules or limits that apply (your constraints), write those constraints as equations or inequalities, and then analyze which combinations of variable values satisfy all the constraints simultaneously.
Decision Variables
Constraints
Feasible Region
Viable vs. Nonviable Solutions
System of Constraints
Visualizing the Feasible Region
When you have two decision variables, you can graph every constraint on the coordinate plane. Each inequality divides the plane into two half-planes — one that satisfies the inequality and one that doesn't. The feasible region is the overlap of all the half-planes that satisfy every constraint. Any point inside this region represents a viable combination of your variables; any point outside is nonviable.
Notice how the feasible region is always a polygon (or sometimes unbounded in one direction). The corner points (also called vertices) of this polygon are particularly important because, as you'll learn in later courses, optimal solutions often occur at these corners. For now, the key skill is determining whether a given point lies inside or outside the region, which tells you if that solution is viable.
Mathematical Framework
Translating a word problem into a system of constraints follows a consistent set of steps. First, define your variables clearly. Then express each real-world limitation as a mathematical statement. The type of statement — equation or inequality — depends on whether the constraint is an exact requirement or a bound.
Translating Words into Constraints
The hardest part of constraint modeling isn't the algebra — it's the translation from English (or any natural language) into mathematical symbols. The diagram below provides a systematic reference for converting common real-world phrases into the correct mathematical symbols. Study it carefully, because once you master this translation step, the rest of the process becomes much more manageable.
| English Phrase | Math Symbol | Example Constraint |
|---|---|---|
| "is," "equals," "totals" | = | 300x + 400y = 2000 (exactly 2000 cal) |
| "at most," "no more than" | ≤ | 5x + 3y ≤ 50 (budget ≤ $50) |
| "at least," "no fewer than" | ≥ | 20x + 15y ≥ 60 (at least 60 g protein) |
| "fewer than," "less than" | < | x < 10 (fewer than 10 servings) |
| "more than," "exceeds" | > | y > 2 (more than 2 servings) |
Worked Example: Meal Planning on a Budget
Let's walk through a complete problem from start to finish. A school cafeteria wants to design a lunch that combines chicken wraps and veggie bowls. Each chicken wrap costs $4 and provides 500 calories and 30 grams of protein. Each veggie bowl costs $3 and provides 350 calories and 12 grams of protein. The cafeteria has a budget of $36, wants the total meal to supply at least 60 grams of protein, and cannot exceed 3500 total calories. How can we model these constraints, and is the combination of 5 chicken wraps and 4 veggie bowls viable?
Strengths, Limitations & Common Pitfalls
Constraint modeling is remarkably versatile, but it also has important limitations that you should be aware of. Understanding where the approach works well and where it falls short will make you a more thoughtful problem solver.
| Strengths | Limitations |
|---|---|
| Converts vague real-world restrictions into precise math that can be analyzed systematically | Requires careful reading — a single mistranslated word can flip ≤ to ≥ and change the entire solution |
| Scales to many variables and many constraints (computers handle huge systems) | With more than two variables, you can't easily graph the feasible region on a 2D coordinate plane |
| Clearly separates viable from nonviable solutions — no guessing required | Real-world constraints are sometimes fuzzy ("about $50") and don't translate perfectly into sharp inequalities |
| Works for both linear and some nonlinear relationships | Nonlinear constraints create curved feasible regions that are harder to analyze without technology |
| Provides a visual, intuitive picture when graphed (2-variable case) | Integer requirements ("you can't buy half a chicken wrap") add complexity not handled by basic graphing |
Connection to Linear Programming & Beyond
The constraint modeling skills you're building now form the foundation for a powerful area of mathematics called linear programming (LP). In LP, you don't just find viable solutions — you find the optimal solution, the one that maximizes profit or minimizes cost while satisfying all constraints. This is studied in detail in precalculus and college-level courses, but the setup is exactly what you're learning here.
| What You Learn Now (A-CED.3) | What Comes Next (Linear Programming) |
|---|---|
| Define variables from a real-world context | Same skill — this never changes |
| Write constraints as equations/inequalities | Same skill — constraints are the backbone of LP |
| Graph the feasible region (2 variables) | Graph the feasible region and identify corner points |
| Test whether a point is viable or nonviable | Evaluate an objective function at every corner point to find the best option |
| Interpret solutions in context | Interpret optimal solutions and perform sensitivity analysis |
Beyond linear programming, constraint modeling extends into fields like operations research (used by airlines, hospitals, and supply chains), game theory (analyzing strategic decisions), and even machine learning (where constraints help define the boundaries of classification models). Mastering the fundamentals now gives you a passport to all these disciplines.
Practice Problems
Lesson Summary
Modeling with constraints starts by identifying decision variables — the quantities you want to determine — and then translating each real-world limitation into a mathematical equation (for exact requirements) or inequality (for upper or lower bounds). Key English-to-math translations include: "at most" → ≤, "at least" → ≥, and "exactly" → =. Always include non-negativity constraints when variables represent real-world quantities that can't be negative.
The collection of all constraints forms a system of equations and/or inequalities. When graphed for two variables, the overlapping region where all constraints hold is the feasible region. A viable solution satisfies every constraint and makes sense in context, while a nonviable solution violates at least one. To test viability, substitute the proposed values into every constraint — if even one fails, the solution is nonviable. These skills are the foundation for linear programming and optimization problems you'll encounter in more advanced courses.