Digital SAT Math: Linear Inequalities and Systems

Linear inequalities are the language of constraints, describing not just what is equal, but what is possible. On the Digital SAT, you'll move beyond solving simple equations to modeling real-world limitations—from budgeting with a spending cap to determining viable product mixes in a business scenario. Mastering how to solve, graph, and interpret systems of inequalities is essential for tackling some of the test's most applied and conceptually rich problems.

Understanding and Solving Linear Inequalities in One Variable

A linear inequality in one variable, like $3x+5>11$, looks similar to an equation but uses inequality symbols ($>$, $<$, $\ge$, $\le$) instead of an equals sign. The solution is not a single number, but a solution set—a range of values that make the inequality true.

You solve it using the same inverse operations as with equations: add, subtract, multiply, or divide to isolate the variable. The critical rule is that multiplying or dividing both sides of an inequality by a negative number reverses the inequality symbol. For example, solving $-2x<8$ requires dividing by $-2$, which flips the $<$ to $>$: $x>-4$.

The solution is graphed on a number line. A closed circle ($\bullet$) indicates the endpoint is included ($\ge$ or $\le$), while an open circle ($\circ$) indicates it is not included ($>$ or $<$). A ray is then shaded in the direction of all numbers that satisfy the inequality. The inequality $x\le 1$ is graphed with a closed circle at 1 and shading extending left, while $x>-3$ uses an open circle at -3 and shading to the right.

Graphing Linear Inequalities in Two Variables

A linear inequality in two variables, such as $y\le 2x+1$, has a solution set consisting of all ordered pairs $(x,y)$ that satisfy it. The graph is a half-plane on the coordinate plane.

The process is methodical:

1. Graph the Boundary Line. Start by graphing the related linear equation (e.g., $y=2x+1$). Use a solid line if the inequality is $\ge$ or $\le$ (points on the line are included in the solution). Use a dashed line if it is $>$ or $<$ (points on the line are not included).
2. Test a Point to Determine Shading. Choose a test point not on the line—the origin $(0,0)$ is often easiest, provided the line doesn't pass through it. Substitute the coordinates into the original inequality.

• If it creates a true statement, shade the entire region containing that test point.
• If false, shade the opposite region.

For $y\le 2x+1$, you'd graph a solid line for $y=2x+1$. Testing $(0,0)$ gives $0\le 2(0)+1$, or $0\le 1$, which is true. Therefore, you shade the half-plane that contains the origin. Every point in the shaded region, including those on the solid line, is a valid solution to the inequality.

Solving Systems of Linear Inequalities

A system of linear inequalities involves two or more inequalities with the same variables. The solution to the system is the set of all points that satisfy every inequality simultaneously. Graphically, this is the overlapping shaded region where all individual solution sets intersect. This region is often called the feasible region or solution region.

To solve a system graphically:

1. Graph each inequality on the same coordinate plane, using the correct line type (solid/dashed) and shading.
2. Identify the region where the shadings all overlap. This is your solution set.
3. The corner points (or vertices) of this polygon-shaped feasible region are often of special interest, especially in optimization problems.

Consider the system: $y\ge x-2$, $y<3$, and $x\ge 0$.

• Graph $y=x-2$ with a solid line and shade above it.
• Graph $y=3$ with a dashed line and shade below it.
• Graph $x=0$ (the y-axis) with a solid line and shade to the right of it.

The feasible region is a triangular area bounded by these three lines. Points inside this triangle satisfy all three conditions.

Interpreting Constraint Regions and Optimization

The Digital SAT frequently presents word problems where a system of inequalities models real-world constraints (like limits on time, money, or materials). The overlapping feasible region you graph represents all possible solutions that adhere to these constraints.

A common follow-up question involves optimization—finding the maximum or minimum value of an objective function (like profit $P=5x+3y$) within the feasible region. A key theorem in linear programming states that the optimal value, if it exists, will occur at one of the vertices (corner points) of the feasible region.

Process for an Optimization Problem:

1. Translate the word problem into a system of inequalities. Define your variables clearly.
2. Graph the system and identify the feasible region and its corner points.
3. List the coordinates of each vertex. You may need to solve a system of two equations (from the boundary lines) to find them.
4. Plug each vertex's coordinates into the objective function.
5. Compare the results. The largest output is the maximum; the smallest is the minimum.

For example, if constraints form a quadrilateral with vertices at $(0,0)$, $(4,0)$, $(2,3)$, and $(0,2)$, you would evaluate your profit function $P$ at each point: $P(0,0)$, $P(4,0)$, $P(2,3)$, $P(0,2)$. The greatest among these is the maximum achievable profit given the constraints.

Common Pitfalls

Misplacing the Shaded Region: The most common graphing error is shading on the wrong side of the boundary line. Always use a test point. If you pick $(0,0)$ and the line passes through the origin, you must choose another point like $(0,1)$ or $(1,0)$.

Confusing Solid and Dashed Lines: Remember, a dashed line means the points on that line are not solutions to the inequality. On the SAT, a problem asking for the maximum value of $x$ in a system where one line is dashed means the vertex on that dashed line is not actually included in the set. The maximum $x$ would be the largest $x$-coordinate from vertices that are strictly inside the shaded region or on solid boundaries.

Forgetting to Reverse the Inequality Sign: When solving one-variable inequalities, multiplying or dividing by a negative number requires flipping the inequality symbol. If you forget this, your solution set will be completely inverted. A quick check: if you end with something like $x>-2$, test a number greater than $-2$ (like $0$) in the original inequality to verify it works.

Misidentifying the Feasible Region: When graphing a system, shade lightly for each inequality. The final feasible region should be distinctly darker or clearly marked. Avoid the mistake of thinking the solution is where any shading exists; it is specifically where all shaded areas intersect.

Summary

• Solving one-variable inequalities follows equation rules, with the crucial added step of reversing the inequality sign when multiplying/dividing by a negative. The solution is graphed on a number line using open/closed circles.
• Graphing two-variable inequalities involves graphing a solid or dashed boundary line and then shading the correct half-plane, determined reliably by testing a point like the origin.
• The solution to a system of inequalities is the graphical overlap of all individual solution sets, known as the feasible region.
• In optimization problems, constraints are modeled by a system of inequalities. The optimal value (max/min) of an objective function is found by evaluating it at the vertices of the feasible region.
• On the Digital SAT, always pay meticulous attention to solid vs. dashed lines (inclusion vs. exclusion) and double-check your shading direction to accurately define the solution set.