Modeling with Equation/Inequality Constraints - Algebra 2

SECTION 1

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.

~1800 BCE • Babylonian Optimization

Babylonian clay tablets show problems about dividing land and resources subject to constraints, solved using early algebraic reasoning — some of the oldest known word problems.

1827 • Fourier's Inequality Work

French mathematician Joseph Fourier studied systems of linear inequalities, laying theoretical groundwork for understanding regions of feasible solutions.

1939 • Birth of Linear Programming

Soviet mathematician Leonid Kantorovich formulated the first linear programming problem to optimize plywood production, formally connecting constraint inequalities to real-world decision-making.

1947 • The Simplex Method

George Dantzig developed the simplex algorithm for the U.S. Air Force, enabling computers to solve massive systems of constraint equations and inequalities for logistics and planning.

Today • Constraints Everywhere

From airline scheduling to nutritional planning apps to video game design, systems of equations and inequalities power billions of optimization decisions every day.

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.

SECTION 2

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

These are the unknown quantities you're trying to determine — typically represented by x, y, or z. For example, the number of servings of each food item or the number of hours spent on each task.

Constraints

Rules or limits expressed as equations (=) or inequalities (≤, ≥, <, >). A budget limit like "spend no more than $50" becomes an inequality. A requirement like "must have exactly 2000 calories" becomes an equation.

Feasible Region

The set of all points (variable combinations) that satisfy every constraint at the same time. On a graph, this appears as a shaded region where all inequality shadings overlap.

Viable vs. Nonviable Solutions

A viable solution lies inside the feasible region and makes real-world sense (e.g., no negative quantities). A nonviable solution violates at least one constraint or doesn't make sense in context (like half a person).

System of Constraints

Multiple equations and/or inequalities considered together. The solution must satisfy all of them simultaneously, not just one at a time.

✦

KEY TAKEAWAY

Think of constraint modeling like planning a road trip with a fixed budget, a car that holds only so much gas, and friends who refuse to drive more than 8 hours a day. Each of those limits is a constraint. The set of trips that satisfy every rule — that's your feasible region. Any trip plan outside those limits is nonviable, no matter how fun it sounds.

SECTION 3

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.

The shaded polygon represents all combinations of Food A and Food B servings that satisfy three constraints simultaneously: the calorie cap (y ≤ 6, pink), the budget (3x + 2y ≤ 24, violet), and the supply limit (x ≤ 8, amber). The green point (6, 2) is viable; the red point (9, 5) is nonviable because it violates both the budget and supply constraints.

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.

SECTION 4

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.

EQUALITY CONSTRAINT (EXACT REQUIREMENT)

a₁x + b₁y = c₁

Use an equation when a condition must be met exactly. For instance, "the meal must contain exactly 2000 calories" translates to an equation where a₁ and b₁ are the calories per serving of each food and c₁ = 2000.

INEQUALITY CONSTRAINT (UPPER BOUND)

a₂x + b₂y ≤ c₂

Use ≤ when a quantity must stay at or below a limit. For example, "spend no more than $50" becomes a cost inequality where a₂ and b₂ are costs per serving and c₂ = 50.

INEQUALITY CONSTRAINT (LOWER BOUND)

a₃x + b₃y ≥ c₃

Use ≥ when a quantity must meet a minimum. For example, "get at least 50 grams of protein" becomes a protein inequality where c₃ = 50.

NON-NEGATIVITY CONSTRAINTS

x ≥ 0 and y ≥ 0

In most real-world contexts, you can't have negative quantities — you can't eat −3 servings of chicken. These constraints are often implied, but you should always write them out explicitly.

💡

Choosing = vs. ≤ vs. ≥

Read the problem's language carefully. Words like "exactly," "must equal," or "is" signal an equation (=). Words like "at most," "no more than," or "cannot exceed" signal ≤. Words like "at least," "no fewer than," or "minimum of" signal ≥. Misreading these cues is one of the most common mistakes in constraint modeling.

SECTION 5

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.

This flowchart guides you from reading a word problem all the way through writing each constraint. Notice the critical decision diamond in the middle: identify whether the language describes an exact condition (equation) or a bounded condition (inequality), then choose the correct symbol.

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)

Common English-to-math translations for constraint modeling

SECTION 6

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?

Meal Planning Constraint Problem

1
Step 1 — Define Variables

Let x = number of chicken wraps and y = number of veggie bowls. Both must be non-negative whole numbers in this context: x ≥ 0, y ≥ 0.

x = chicken wraps, y = veggie bowls
2
Step 2 — Write the Budget Constraint

Each wrap costs $4 and each bowl costs $3. The total cost must be at most $36. The phrase "at most" tells us to use ≤. So: 4x + 3y ≤ 36.

4x + 3y ≤ 36
3
Step 3 — Write the Protein Constraint

Each wrap provides 30 g protein and each bowl provides 12 g. The cafeteria wants at least 60 g total. "At least" signals ≥. So: 30x + 12y ≥ 60.

30x + 12y ≥ 60
4
Step 4 — Write the Calorie Constraint

Each wrap has 500 cal and each bowl has 350 cal. The total cannot exceed 3500 cal. "Cannot exceed" means ≤. So: 500x + 350y ≤ 3500.

500x + 350y ≤ 3500
5
Step 5 — Test the Proposed Solution (5, 4)

Substitute x = 5 and y = 4 into each constraint. Budget: 4(5) + 3(4) = 20 + 12 = 32 ≤ 36 ✓. Protein: 30(5) + 12(4) = 150 + 48 = 198 ≥ 60 ✓. Calories: 500(5) + 350(4) = 2500 + 1400 = 3900 ≤ 3500? No — 3900 > 3500 ✗. Since the calorie constraint is violated, this solution is nonviable.

(5, 4) is NONVIABLE — violates the calorie constraint
6
Step 6 — Find a Viable Alternative

Try x = 4 and y = 3. Budget: 4(4) + 3(3) = 16 + 9 = 25 ≤ 36 ✓. Protein: 30(4) + 12(3) = 120 + 36 = 156 ≥ 60 ✓. Calories: 500(4) + 350(3) = 2000 + 1050 = 3050 ≤ 3500 ✓. All constraints are satisfied and the values are non-negative integers.

(4, 3) is VIABLE — satisfies all constraints

SECTION 7

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

Strengths and limitations of constraint modeling with equations and inequalities

⚠️

WATCH OUT

The most common mistake students make is forgetting to check every single constraint when deciding if a solution is viable. A point can satisfy four out of five inequalities and still be nonviable because it fails the fifth. Always test systematically — substitute into each constraint one at a time and confirm each one holds.

SECTION 8

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

How A-CED.3 skills connect to advanced optimization

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.

SECTION 9

Practice Problems

Question 1: CONCEPTUAL

A student writes the constraint "I need at least 8 hours of sleep" as s ≤ 8, where s represents hours of sleep. Explain what's wrong with this inequality and write the correct version.

Show answer

The phrase "at least 8 hours" means 8 or more, which requires ≥, not ≤. The correct constraint is s ≥ 8. The student's version (s ≤ 8) says "no more than 8 hours," which is the opposite of the intended meaning. This is one of the most common translation errors — always match the direction of the inequality to the meaning of the English phrase.

Question 2: BASIC CALCULATION

A baker makes cupcakes (x) and cookies (y). Each cupcake requires 2 eggs, and each cookie requires 1 egg. The baker has 24 eggs available. Write the constraint. Then determine: is the combination (10, 6) viable for this constraint?

Show answer

The egg constraint is 2x + y ≤ 24. Substituting (10, 6): 2(10) + 6 = 20 + 6 = 26. Since 26 > 24, the combination violates the constraint. Therefore (10, 6) is nonviable for this constraint — the baker doesn't have enough eggs. A viable alternative might be (10, 4), which gives 2(10) + 4 = 24, exactly using all available eggs.

Question 3: INTERMEDIATE

A student is scheduling study time for math (m hours) and science (s hours) this week. They have at most 15 hours total to study, need at least 4 hours for math, and need at least 3 hours for science. Write the complete system of constraints (including non-negativity). Then determine whether (5, 12) and (8, 6) are viable.

Show answer

The system is: m + s ≤ 15 (total time limit), m ≥ 4 (math minimum), s ≥ 3 (science minimum), m ≥ 0 and s ≥ 0 (non-negativity, which are redundant given the minimums but good practice to include). Test (5, 12): 5 + 12 = 17 > 15 ✗. This is nonviable because total hours exceed 15. Test (8, 6): 8 + 6 = 14 ≤ 15 ✓, 8 ≥ 4 ✓, 6 ≥ 3 ✓. All constraints satisfied, so (8, 6) is viable. The student can study 8 hours of math and 6 hours of science and stay within all limits.

Question 4: APPLIED

A pet shelter is buying bags of dog food (d) and cat food (c). Dog food costs $12 per bag and cat food costs $8 per bag. The shelter has a budget of $120, needs at least 5 bags of dog food, and needs at least 3 bags of cat food. Their storage room can hold at most 14 bags total. Write the full system of constraints and find two viable integer solutions and one nonviable integer solution.

Show answer

The system is: 12d + 8c ≤ 120 (budget), d ≥ 5 (dog food minimum), c ≥ 3 (cat food minimum), d + c ≤ 14 (storage), d ≥ 0, c ≥ 0. Viable solution 1: (5, 5). Budget: 12(5) + 8(5) = 100 ≤ 120 ✓, d = 5 ≥ 5 ✓, c = 5 ≥ 3 ✓, total = 10 ≤ 14 ✓. Viable solution 2: (7, 4). Budget: 12(7) + 8(4) = 116 ≤ 120 ✓, d = 7 ≥ 5 ✓, c = 4 ≥ 3 ✓, total = 11 ≤ 14 ✓. Nonviable: (8, 6). Budget: 12(8) + 8(6) = 144 > 120 ✗. Even though it satisfies storage and minimums, the cost exceeds the budget.

Question 5: CRITICAL THINKING

Consider the system: x + y ≤ 10, x ≥ 7, y ≥ 5, x ≥ 0, y ≥ 0. Without graphing, explain whether this system has any viable solutions. What does this tell you about real-world modeling?

Show answer

This system has no viable solutions. From x ≥ 7 and y ≥ 5, the smallest possible value of x + y is 7 + 5 = 12. But the first constraint requires x + y ≤ 10. Since 12 > 10, no combination of x and y can satisfy all three constraints simultaneously — the feasible region is empty. In real-world modeling, this is a critically important finding: it means the constraints are contradictory. For example, if you need at least 7 hours for one task and 5 hours for another but only have 10 hours total, the plan is impossible. Recognizing infeasibility is just as valuable as finding solutions, because it tells decision-makers they must relax at least one constraint.

SUMMARY

Lesson Summary

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.