What this learning objective is really asking you to learn
This objective asks students to represent constraints and systems in modeling contexts and then interpret viable and non-viable solutions. A constraint is a condition that limits possible values. It might be a budget, a minimum requirement, a maximum capacity, a deadline, a safety limit, a domain restriction, or a physical law. A system is a collection of constraints or equations that must be satisfied together.
Students first met this idea in Math I with linear systems and inequalities. In Math III, constraints may involve more advanced expression types and more realistic modeling decisions. A system might include a rational cost model, a polynomial design formula, a radical measurement constraint, or a nonlinear function. The goal is not only to solve algebraically but to decide what solutions make sense.
A viable solution is a solution that satisfies both the mathematics and the context. A non-viable solution may satisfy a transformed equation but fail a domain restriction, physical condition, unit requirement, or practical constraint. For example, a negative time may be algebraically produced but contextually impossible. A fractional number of people may be mathematically allowed in a continuous model but not viable in a counting problem. A value that makes a denominator zero is not allowed even if it appears during manipulation.
This objective is about decision regions. Sometimes there is one solution. Sometimes there are many. Sometimes no solution satisfies all constraints. Sometimes algebra gives several candidates, and context filters them. Students should be able to explain not only what the solution is but why it is or is not viable.
Why students should learn this math
Students should learn this because real life is rarely unconstrained. People do not make choices with infinite time, money, space, materials, energy, or risk tolerance. A design must fit a space and stay under budget. A business must meet demand and control cost. A medication must be effective but not exceed a safe dose. A student must balance homework, sleep, work, and practice. A city must allocate land among housing, roads, parks, utilities, and environmental limits.
Mathematics becomes powerful when it can represent these limits. A single equation may describe a relationship. A system of constraints describes a decision environment. The feasible or viable solutions are the choices that obey all rules at once.
This objective also teaches students that not all mathematically produced answers are acceptable. In pure algebra, \(x = -5\) may be a solution. In a problem where \(x\) represents number of units produced, it is not viable. In a rational equation, multiplying by a denominator may create a candidate that makes the original denominator zero. In a radical equation, squaring may create an extraneous solution. In a modeling context, units, signs, discreteness, and physical limits matter.
This is a crucial life skill. Many bad decisions come from optimizing one variable while ignoring constraints. A plan may be cheap but unsafe. Fast but illegal. Profitable but impossible to supply. Mathematically efficient but unfair. Constraint reasoning trains students to ask, “What must also be true?”
The “why” is that systems of constraints are the mathematics of possible choices. They teach students to separate the possible from the impossible and the algebraically produced from the contextually meaningful.
The historical machinery: feasibility and optimization
Constraint reasoning has ancient roots in resource allocation, trade, land measurement, and engineering. But it became especially formal in modern operations research and optimization. During the twentieth century, governments, militaries, and businesses needed methods for allocating limited resources: transportation, supplies, labor, time, and money. Systems of inequalities and equations became tools for describing feasible choices.
Linear programming is one famous development. It represents constraints as inequalities and seeks the best outcome within the feasible region. Math III students may not be doing full linear programming, but the idea of constraints and viable solutions belongs to the same family.
In engineering and science, constraints are equally central. A design must satisfy physical laws. A bridge must support loads within material limits. A circuit must satisfy voltage and current relationships. A chemical process must satisfy conservation and safety constraints. A probability model must satisfy total probability rules.
The historical lesson is that mathematics is often not about finding any answer. It is about finding answers that obey all the conditions. Feasibility comes before optimization.
Where this fits in the big map of mathematics
This objective follows equation creation in two or more variables. Once students can model relationships, they must model constraints among relationships.
It connects backward to Math I systems and inequalities. The idea of feasible regions and viable solutions began with linear constraints. Math III generalizes the modeling mindset.
It connects to rational and radical equations because domain restrictions often create viability issues.
It connects to functions and graphing. A system may be represented by intersections of graphs or overlapping regions.
It connects to optimization. Before choosing a best solution, students must know which solutions are possible.
It connects to statistics and probability because constraints can also describe decision rules, sample restrictions, or feasible outcomes.
The big-map role is feasibility. Students learn that mathematical modeling must respect limits.
How to execute the skill technically
Use this process:
- Define variables and units.
- List constraints in words.
- Translate each constraint into an equation or inequality.
- Solve or graph the system.
- Identify candidates or feasible regions.
- Apply context restrictions.
- Interpret viable and non-viable solutions.
Example: A company makes two products, A and B. Product A requires 2 labor hours and product B requires 3 labor hours. The company has at most 120 labor hours. It must produce at least 20 total products. Let \(a\) and \(b\) be numbers of products A and B.
Constraints:
\(a \ge 0\), \(b \ge 0\).
If products must be whole units, \(a\) and \(b\) must be integers.
A point like \((30, 10)\) uses \(2(30) + 3(10) = 90\) labor hours and produces 40 products, so it is viable. A point like \((10, 5)\) uses only 35 labor hours but produces only 15 products, so it violates the minimum production constraint. A point like \((20.5, 10)\) may satisfy continuous inequalities but not whole-unit production.
The same logic applies to nonlinear contexts. If a design requires area at least 100 and perimeter no more than 60, the constraints may involve products and sums. If a cost average must be below a target, a rational inequality may appear.
Worked example: rational constraint
A company has average cost
where \(x\) is units produced and \(x > 0\). The company wants average cost at most $35 per unit and can produce no more than 500 units. Find the viable production range.
Cost constraint:
Since \(x > 0\), multiply by \(x\):
So
and
Capacity constraint:
Viable range:
If units must be whole numbers, then \(x\) must be an integer from 200 through 500.
This example shows a system with a rational inequality and a capacity constraint. The algebra gives the lower bound, but the context gives positivity, capacity, and discreteness.
Upgrade example: nonlinear constraints
Not all constraints are linear. Suppose a rectangular enclosure must have area at least 200 square meters, and the available fencing allows perimeter at most 70 meters. Let \(l\) be length and \(w\) be width.
Area constraint:
Perimeter constraint:
Nonnegative constraints:
\(l > 0\), \(w > 0\).
This system includes a nonlinear constraint because of the product \(lw\). A point like \((20, 10)\) gives area 200 and perimeter 60, so it is viable. A point like \((30, 5)\) gives area 150 and perimeter 70, so it fails the area constraint. A point like \((40, 10)\) gives enough area but perimeter 100, so it fails the fencing constraint.
This example shows why Math III constraints go beyond shaded half-planes. The same feasibility idea remains, but the boundaries may curve.
Viability versus optimality
A viable solution is not necessarily the best solution. It only satisfies the constraints. If a design problem asks for minimum cost or maximum area, then after identifying the viable region, students still need a criterion for “best.” This distinction is essential.
For example, many rectangle dimensions may satisfy area and perimeter constraints. If the goal is cheapest material, one choice may be better. If the goal is maximum usable width, another may be better. If the goal is aesthetic proportion, another may be selected. Constraints define what is allowed; an objective function or decision criterion chooses among allowed options.
This is the seed of optimization. Students are not required to master advanced optimization here, but they should know the difference between feasible and optimal.
Hidden constraints
Some constraints are not stated in equations but come from context. Counts must often be whole numbers. Lengths must be nonnegative. Probabilities must be between 0 and 1. Percentages may be between 0 and 100. Denominators cannot be zero. Square-root inputs may need to be nonnegative.
A strong modeler adds these hidden constraints explicitly. If \(x\) is number of people, write \(x\) is a nonnegative integer. If \(r\) is radius, write \(r > 0\). If \(p\) is probability, write \(0 \le p \le 1\). These small statements prevent many wrong answers.