Digital SAT Math: Systems of Inequalities Word Problems

Mastering systems of linear inequalities is a critical skill for the Digital SAT Math section, representing a unique blend of algebraic reasoning, graphical analysis, and real-world problem-solving. This question type tests your ability to model a scenario mathematically, visualize constraints, and find optimal solutions, moving beyond routine equation-solving to applied mathematical thinking. A strong performance here can significantly boost your score, as these multi-step problems are designed to differentiate between a good and a great math student.

From Words to Inequalities: Translating Constraints

The first and most crucial step is turning a written description into a precise mathematical model. Every condition in the word problem becomes an inequality. Key phrases are your guide: "at least" translates to $\ge$, "at most" to $\le$, "no more than" also means $\le$, and "must exceed" means $>$. You will typically define variables at the start, such as letting $x$ represent the number of one product and $y$ the number of another.

Consider a classic scenario: A bakery makes cakes and pies. Each cake requires 2 cups of flour, and each pie requires 1.5 cups. They have 30 cups of flour available for the day. Furthermore, their oven can only hold a maximum of 18 items total. If we let $c$ be the number of cakes and $p$ be the number of pies, the constraints become:

• Flour constraint: $2c+1.5p\le 30$
• Oven capacity constraint: $c+p\le 18$
• Non-negativity constraints: $c\ge 0$, $p\ge 0$ (You can't make a negative number of items.)

These last two constraints are often implicit but are essential for defining a realistic feasible region.

Graphing the System and Defining the Feasible Region

Once you have your system of inequalities, the next step is to graph them on the $xy$-plane (or $cp$-plane in our example). Treat each inequality as if it were an equation to graph the boundary line. For $2c+1.5p=30$, find the intercepts: if $c=0$, then $p=20$; if $p=0$, then $c=15$. Plot these points and draw a solid line (solid because the inequality is $\le$, meaning points on the line are included). The inequality $2c+1.5p\le 30$ means we shade the region below this line.

Repeat this process for $c+p\le 18$ (intercepts at (0,18) and (18,0)) and the non-negative axes. The feasible region is the area where all shaded areas overlap. This polygon, bounded by the axes and the constraint lines, contains every possible combination of cakes and pies that satisfies all the bakery's limitations. On the Digital SAT, you may use the built-in graphing tool to visualize this region quickly, but understanding how to sketch it is vital for verification.

Identifying Corner Points: The Vertices of Possibility

The corners, or vertices, of the feasible region polygon are paramount. For linear optimization problems, the maximum or minimum value of an objective function (like profit or cost) will always occur at one of these corner points. To find them, you solve the system of equations formed by the intersecting boundary lines.

In our bakery example, the corners are:

1. The origin: (0, 0)
2. The x-intercept of the flour line: (15, 0)
3. The y-intercept of the oven line: (0, 18)
4. The intersection of the two constraint lines: $2c+1.5p=30$ and $c+p=18$.

To find the fourth point, solve the system. From $c+p=18$, we get $c=18-p$. Substitute into the flour equation: $$2(18-p)+1.5p=30$$ $$36-2p+1.5p=30$$ $$36-0.5p=30$$ $$-0.5p=-6$$ $$p=12$$ Then, $c=18-12=6$. So, the intersection point is (6, 12).

Optimization: Finding the Maximum or Minimum

The final step is optimization. The problem will define an objective function, such as "The bakery makes a profit of $15percakeand$12 per pie. Find the maximum profit." This gives us $P=15c+12p$. We evaluate this function at every corner point of the feasible region.

1. At (0, 0): $P=15(0)+12(0)=0$
2. At (15, 0): $P=15(15)+12(0)=225$
3. At (0, 18): $P=15(0)+12(18)=216$
4. At (6, 12): $P=15(6)+12(12)=90+144=234$

The maximum profit is $234,achievedbymaking6cakesand12pies.Youmustalwaysstateyourfinalanswer\ast inthecontextoftheproblem\ast :"Themaximumprofitof$234 occurs when 6 cakes and 12 pies are made."

Common Pitfalls

Misinterpreting Inequality Direction: Confusing "at least" ($\ge$) with "at most" ($\le$) will flip your shaded region and produce a completely wrong feasible region. Always pause to translate the phrase carefully. For example, "needs at least 10 units" means $x\ge 10$, shading to the right of the vertical line $x=10$.

Forgetting Non-Negativity Constraints: In most real-world contexts, quantities like items produced, time spent, or people counted cannot be negative. If you omit $x\ge 0$ and $y\ge 0$, your feasible region may extend into negative quadrants, leading to impossible "optimal" solutions. Always ask: "Could this variable reasonably be negative?"

Incorrectly Testing for Optima: A common mistake is to assume the optimal point is always the intersection of the two main constraints. While it often is, you must test all corner points. The optimum could be at an axis intercept, especially if the objective function's coefficients (profit margins) heavily favor one variable over the other. Systematically list and evaluate every vertex.

Graphical Shading Errors: Shading the wrong side of a boundary line will distort the feasible region. A reliable check: pick a test point not on the line, like (0,0) if it's not on the boundary. Plug it into the inequality. If it makes the inequality true, shade the region containing that test point. If false, shade the opposite side.

Summary

• Translate words to math meticulously: Identify variables and convert phrases like "at most" and "at least" into the correct inequality symbols ($\le$, $\ge$).
• The feasible region is key: It is the graphically overlapping area defined by all inequalities, including implicit non-negativity constraints ($x\ge 0,y\ge 0$).
• Optimal solutions lie at corners: For linear objective functions, the maximum or minimum value will always occur at a vertex of the feasible region polygon.
• Solve systems to find vertices: Find corner points by solving the related equations of the intersecting boundary lines.
• Evaluate and compare: Plug each corner point coordinate into the objective function to determine which yields the optimal value.
• Contextualize your answer: Always express your final answer in a sentence that refers back to the original word problem's scenario.