Study guide

3.5 Systems with Constraints & Multi-Equation Modeling

SAT Math Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Introduction & Digital SAT Math Mechanics

1.1 Digital SAT Math Structure, Adaptive Routing & Scoring 1.2 Mastering the Built-In Desmos Graphing Calculator 1.3 Digital SAT Math Pacing, SPR Syntax & Test-Taking Tactics

2 Chapter 2: Algebra — Linear Equations, Functions & Inequalities

2.1 Linear Equations in One Variable 2.2 Determining the Number of Solutions 2.3 Linear Functions, Slope & Rate of Change 2.4 Forms of Linear Equations & Interpreting Intercepts 2.5 Real-World Linear Modeling & Word Problems 2.6 Linear Inequalities in One Variable 2.7 Linear Inequalities in Two Variables & Feasible Regions

3 Chapter 3: Algebra — Systems of Linear Equations & Applications

3.1 Solving Systems of Linear Equations Algebraically 3.2 Graphical Interpretation of Linear Systems 3.3 Constants & Coefficients in Systems with Special Solutions 3.4 Real-World Applications & Word Problems with Systems 3.5 Systems with Constraints & Multi-Equation Modeling

4 Chapter 4: Advanced Math — Quadratics & Nonlinear Equations

4.1 Factoring & Equivalent Algebraic Expressions 4.2 Solving Quadratic Equations by Multiple Methods 4.3 The Discriminant & Nature of Roots 4.4 Forms of Quadratic Functions & Feature Recognition 4.5 Parabolas: Vertex, Axis of Symmetry & Extrema in Context 4.6 Radical Equations & Extraneous Solutions 4.7 Systems of Linear and Nonlinear Equations

5 Chapter 5: Advanced Math — Exponentials, Polynomials & Functions

5.1 Exponent Rules & Radical Expressions 5.2 Exponential Functions: Growth & Decay Models 5.3 Compound Interest, Doubling Time & Half-Life Applications 5.4 Polynomial Operations, Division & Remainder Theorem 5.5 Graphs of Polynomials, Zeros & Multiplicity 5.6 Function Notation, Composition & Transformations

6 Chapter 6: Problem-Solving and Data Analysis

6.1 Ratios, Proportions & Dimensional Analysis 6.2 Percentages, Percent Change & Successive Percents 6.3 One-Variable Statistics: Center, Spread & Outliers 6.4 Two-Variable Data: Scatterplots & Line of Best Fit 6.5 Probability & Two-Way Frequency Tables 6.6 Statistical Study Design, Margin of Error & Generalization

7 Chapter 7: Geometry and Trigonometry

7.1 Lines, Angles & Triangle Properties 7.2 Congruent & Similar Triangles with Proportions 7.3 Right Triangles & Pythagorean Theorem 7.4 Right Triangle Trigonometry & Radian Measure 7.5 Circle Equations, Center & Radius in Coordinate Plane 7.6 Arc Length, Sector Area & 3D Geometry / Volume

3.5 Systems with Constraints & Multi-Equation Modeling

Key Takeaways Explain This Topic AI

Real-world systems frequently involve inequality constraints (e.g., maximum budget, minimum capacity, labor hours) defining a bounded feasible region.

When modeling discrete items (people, tables, vehicles, tickets), solutions must be restricted to non-negative integers; fractional values must be evaluated in context.

Underdetermined systems (e.g., 3 variables with only 2 equations) cannot yield unique values for each variable, but can be solved for specific compound sums or linear combinations.

On linear inequality systems, vertices (corner intersection points of boundary lines) represent the critical extrema for optimization problems.

Translating phrasing like 'at least', 'no more than', and 'exceeds by' into correct inequality symbols (>=, <=, >) is essential for constructing accurate models.

Last updated: August 2026

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:

English Phrase Mathematical Inequality Notes & Common Errors

" x x x is at least k k k " x ≥ k x \ge k x ≥ k Includes k k k as a valid boundary point.

" x x x is no more than k k k " / "at most k k k " x ≤ k x \le k x ≤ k Includes k k k ; upper cap.

" x x x exceeds y y y by k k k " x − y > k x - y > k x − y > k or x = y + k + … x = y + k + \dots x = y + k + … x x x is strictly larger than y y y .

" x x x is no less than k k k " x ≥ k x \ge k x ≥ k Equivalent to at least k k k .

"Total budget cannot exceed $B" C 1 x + C 2 y ≤ B C_1x + C_2y \le B C 1 ​ x + C 2 ​ y ≤ B Strict upper ceiling.

"Minimum required capacity is M M M " K 1 x + K 2 y ≥ M K_1x + K_2y \ge M K 1 ​ x + K 2 ​ y ≥ M Lower floor threshold.

Feasible Regions and Vertex Optimization

When multiple linear inequalities constrain a scenario, the set of all points ( x , y ) (x, y) ( 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 x = 7.82 x = 7.82 ). In real-world modeling, many items are discrete :

You cannot buy 3.4 3.4 3.4 buses, hire 6.2 6.2 6.2 workers, or produce − 4 -4 − 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 r r ) that seat 8 8 8 guests and rectangular tables ( t t t ) that seat 12 12 12 guests. The planner must provide seating for at least 160 160 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. { 8 r + 12 t ≥ 160 (Guest seating capacity) 20 r + 30 t ≤ 420 (Budget constraint) r ≥ 0 , t ≥ 0 (Non-negativity) \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} ⎩ ⎨ ⎧ ​ 8 r + 12 t ≥ 160 20 r + 30 t ≤ 420 r ≥ 0 , t ≥ 0 ​ (Guest seating capacity) (Budget constraint) (Non-negativity) ​

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

Step 3: Analyze the capacity line. 8 r + 12 t ≥ 160 ⟹ 2 r + 3 t ≥ 40 ⟹ 3 t ≥ 40 − 2 r ⟹ t ≥ 40 − 2 r 3 8r + 12t \ge 160 \implies 2r + 3t \ge 40 \implies 3t \ge 40 - 2r \implies t \ge \frac{40 - 2r}{3} 8 r + 12 t ≥ 160 ⟹ 2 r + 3 t ≥ 40 ⟹ 3 t ≥ 40 − 2 r ⟹ t ≥ 3 40 − 2 r ​

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

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

If t = 0 t = 0 t = 0 : 40 ≤ 2 r ≤ 42 ⟹ 20 ≤ r ≤ 21 40 \le 2r \le 42 \implies 20 \le r \le 21 40 ≤ 2 r ≤ 42 ⟹ 20 ≤ r ≤ 21 .

Check cost for r = 21 , t = 0 r = 21, t = 0 r = 21 , t = 0 : 20 ( 21 ) + 30 ( 0 ) = $ 420 ≤ 420 20(21) + 30(0) = \text{\textdollar}420 \le 420 20 ( 21 ) + 30 ( 0 ) = $ 420 ≤ 420 .

Check seating for r = 21 , t = 0 r = 21, t = 0 r = 21 , t = 0 : 8 ( 21 ) + 12 ( 0 ) = 168 ≥ 160 8(21) + 12(0) = 168 \ge 160 8 ( 21 ) + 12 ( 0 ) = 168 ≥ 160 .

Both conditions are satisfied. The maximum number of round tables is r = 21 r = 21 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 x + y + z 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 x x , y y y , and z z 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

Write the system with like variables aligned in columns.

Look for constants c 1 , c 2 , c 3 c_1, c_2, c_3 c 1 ​ , c 2 ​ , c 3 ​ such that combining the equations produces equal coefficients for all variables.

Factor out the common coefficient to evaluate the compound sum.

Worked Example 2: Compound Sum From a 3-Variable System { 2 x + y + 3 z = 34 x + 2 y + z = 22 3 x + 3 y + 2 z = 40 \begin{cases} 2x + y + 3z = 34 \\ x + 2y + z = 22 \\ 3x + 3y + 2z = 40 \end{cases} ⎩ ⎨ ⎧ ​ 2 x + y + 3 z = 34 x + 2 y + z = 22 3 x + 3 y + 2 z = 40 ​

What is the value of x + y + z x + y + z x + y + z ?

Solution: Add all three equations together: ( 2 x + x + 3 x ) + ( y + 2 y + 3 y ) + ( 3 z + z + 2 z ) = 34 + 22 + 40 (2x + x + 3x) + (y + 2y + 3y) + (3z + z + 2z) = 34 + 22 + 40 ( 2 x + x + 3 x ) + ( y + 2 y + 3 y ) + ( 3 z + z + 2 z ) = 34 + 22 + 40 6 x + 6 y + 6 z = 96 6x + 6y + 6z = 96 6 x + 6 y + 6 z = 96

Factor out 6 6 6 from the left side: 6 ( x + y + z ) = 96 6(x + y + z) = 96 6 ( x + y + z ) = 96 x + y + z = 96 6 = 16 x + y + z = \frac{96}{6} = 16 x + y + z = 6 96 ​ = 16

Desmos Strategy for Systems of Inequalities

Type Inequalities Directly: In Desmos, type y >= 2x - 4 and 3x + 4y <= 24 .

Visual Feasible Region: Desmos shades the region satisfying each inequality. The overlapping intersection region (where both colors crosshatch/blend) represents the solution set.

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 ≥ 0 x \ge 0 x ≥ 0 and y ≥ 0 y \ge 0 y ≥ 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.