3.5 Systems with Constraints & Multi-Equation Modeling

3.5 Systems with Constraints & Multi-Equation Modeling

Quick Summary: Many advanced Digital SAT math questions extend beyond standard 2x2 systems by adding real-world constraints, inequality boundaries, discrete integer requirements, or multi-equation structures (such as three variables with two equations). This section teaches you how to model multi-variable constraints, locate feasible regions, and solve underdetermined systems for compound expressions.

---

Translating Verbal Constraint Phrasing

Mathematical modeling on the SAT requires translating descriptive language into precise relational operators:

---

Feasible Regions and Vertex Optimization

When multiple linear inequalities constrain a scenario, the set of all points $(x, y)$ that satisfy every inequality simultaneously is called the feasible region.

                          y
                          |
                          |      Budget Constraint Line (Ax + By <= B)
                          |     \
                          |      \
                          |       \  FEASIBLE
                          |        \ REGION
                          |   (0,b) \
                          |  *-------* (Vertex)
                          |  |       |\
                          |  |       | \ Capacity Constraint Line
                          +--*-------*--\------------------- x
                           (0,0)   (a,0) \

The Fundamental Principle of Vertex Evaluation

In linear constraint problems, the maximum or minimum possible values of an objective function (such as total cost, maximum revenue, or maximum items) always occur at the vertices (corner points) of the feasible region, where the boundary lines intersect.

---

Discrete Contexts: Integer Constraints

In pure mathematics, variables can take any real number value ($x = 7.82$). In real-world modeling, many items are discrete:

• You cannot buy $3.4$ buses, hire $6.2$ workers, or produce $-4$ chairs.
• When solving an inequality system with discrete items, you must test the nearest valid lattice points (integer pairs) inside the feasible region.

Worked Example 1: Budget and Capacity Constraints

Problem: An event planner is renting round tables ($r$) that seat $8$ guests and rectangular tables ($t$) that seat $12$ guests. The planner must provide seating for at least $160$ guests. Round tables rent for $20 each and rectangular tables rent for $30 each. If the total budget for tables is $420, what is the maximum number of round tables the planner can rent?

• Step 1: Set up constraint inequalities. $\begin{cases} 8r + 12t \ge 160 & \text{(Guest seating capacity)} \\ 20r + 30t \le 420 & \text{(Budget constraint)} \\ r \ge 0, t \ge 0 & \text{(Non-negativity)} \end{cases}$

• Step 2: Analyze the budget line. $20r + 30t \le 420 \implies 2r + 3t \le 42 \implies 3t \le 42 - 2r \implies t \le 14 - \frac{2}{3}r$

• Step 3: Analyze the capacity line. $8r + 12t \ge 160 \implies 2r + 3t \ge 40 \implies 3t \ge 40 - 2r \implies t \ge \frac{40 - 2r}{3}$

• Step 4: Combine constraints on $2r + 3t$. $40 \le 2r + 3t \le 42$

To maximize $r$, we want $t$ to be as small as possible while keeping $t$ a non-negative integer ($t \ge 0$):

• If $t = 0$: $40 \le 2r \le 42 \implies 20 \le r \le 21$.
• Check cost for $r = 21, t = 0$: $20(21) + 30(0) = $420 \le 420$.
• Check seating for $r = 21, t = 0$: $8(21) + 12(0) = 168 \ge 160$.

Both conditions are satisfied. The maximum number of round tables is $r = 21$.

---

Multi-Equation Modeling: The Compound-Sum Shortcut in 3-Variable Systems

On higher-difficulty Digital SAT modules, you may encounter a system in three variables where the prompt asks only for a compound sum such as $x + y + z$. Two situations arise, and the same shortcut serves both:

• Underdetermined systems (3 variables but only 2 independent equations). You genuinely cannot pin down $x$, $y$, and $z$ individually, yet a particular linear combination may still be fully determined.
• Fully determined 3x3 systems. You could solve for all three variables, but doing so burns 60 to 90 seconds you do not have. If the question only wants a combination, take the shortcut and never isolate a single variable.

The Target Linear Combination Strategy

1. Write the system with like variables aligned in columns.
2. Look for constants $c_1, c_2, c_3$ such that combining the equations produces equal coefficients for all variables.
3. Factor out the common coefficient to evaluate the compound sum.

Worked Example 2: Compound Sum From a 3-Variable System

$\begin{cases} 2x + y + 3z = 34 \\ x + 2y + z = 22 \\ 3x + 3y + 2z = 40 \end{cases}$ What is the value of $x + y + z$?

• Solution: Add all three equations together: $(2x + x + 3x) + (y + 2y + 3y) + (3z + z + 2z) = 34 + 22 + 40$ $6x + 6y + 6z = 96$
• Factor out $6$ from the left side: $6(x + y + z) = 96$ $x + y + z = \frac{96}{6} = 16$

---

Desmos Strategy for Systems of Inequalities

1. Type Inequalities Directly: In Desmos, type y >= 2x - 4 and 3x + 4y <= 24.
2. Visual Feasible Region: Desmos shades the region satisfying each inequality. The overlapping intersection region (where both colors crosshatch/blend) represents the solution set.
3. Finding Corner Points: Hover or click where the boundary lines cross to find exact coordinates of the vertices.

---

Summary Checklist for Multi-Equation Modeling

• Strict vs. Non-Strict Inequalities: Verify whether the prompt states "greater than" ($>$) or "at least" ($\ge$).
• Non-Negativity Constraints: For real-world objects, always remember implicit bounds $x \ge 0$ and $y \ge 0$.
• Integer Feasibility: When answers must be whole units, check that candidate vertices yield valid integer combinations.
• Underdetermined Systems: Never spend time trying to isolate individual variables when only a compound sum is requested.