You've got the worksheet in front of you. Three systems. Maybe four. Each one asks you to graph two or three inequalities on the same coordinate plane and find where they all overlap And it works..
Simple, right?
Then you start. In practice, you graph the first line. Practically speaking, dashed or solid? You pause. You graph the second. Which side do you shade? You test a point. (0,0) works — unless the line goes through the origin. Now you're erasing. Again Easy to understand, harder to ignore..
The overlapping region? Even so, or a quadrilateral. Consider this: it's a triangle. Or nothing at all The details matter here..
And suddenly you're not sure if your answer matches the key — because the key just shows a shaded blob with no explanation It's one of those things that adds up..
This is where most students (and honestly, a lot of teachers) get stuck. Think about it: not because the math is hard. Because the process has too many moving parts, and one small slip — a flipped inequality sign, a wrong test point, a solid line that should be dashed — cascades into a completely wrong region.
This is where a lot of people lose the thread Not complicated — just consistent..
Let's fix that Which is the point..
What Is a System of Linear Inequalities
A system of linear inequalities is just two or more linear inequalities that share the same variables. Usually x and y. You're not looking for a single point that satisfies all of them — you're looking for all the points that satisfy every inequality at once The details matter here..
You'll probably want to bookmark this section The details matter here..
Graphically, that's the intersection of half-planes Still holds up..
Each inequality cuts the coordinate plane in two. One side works. That said, the other doesn't. The line itself? That depends on the symbol. ≤ or ≥ means the boundary counts — solid line. < or > means it doesn't — dashed line.
When you put two or three of these together, the solution set is the region where every single shading overlaps. That's it. That's the whole game It's one of those things that adds up..
The difference between equations and inequalities
With equations, you graph lines. The solution is where they cross. One point. Maybe none. Maybe infinite.
With inequalities, you graph regions. Sometimes stretching forever in one direction. Sometimes bounded. The solution is an area. Sometimes empty.
That shift — from point to region — is where the confusion starts.
Why This Shows Up on Every Worksheet (and Test)
Because it's the first time algebra meets geometry in a way that actually models real constraints.
Budget limits. Every one of those translates to an inequality. Minimum requirements. But maximum capacities. Resource caps. Time windows. Put them together and you get a feasible region — the set of all possible solutions that don't break any rules The details matter here..
That's linear programming. That's optimization. That's the foundation of operations research, economics, logistics, scheduling.
But on a worksheet? It's just "graph the system."
The problem: worksheets rarely teach the process. They assume you already know how to:
- Rewrite inequalities in slope-intercept form
- Graph the boundary line correctly
- Pick and test a point
- Shade the correct side
- Repeat for every inequality
- Identify the overlap
Miss one step and the whole thing falls apart It's one of those things that adds up. Practical, not theoretical..
How to Graph a System of Linear Inequalities — Step by Step
There's a rhythm to this. Follow it every time and you'll stop guessing.
1. Rewrite each inequality in slope-intercept form (if needed)
y < 2x + 3 is ready to go. 3x - 2y ≥ 6 is not.
Solve for y:
-2y ≥ -3x + 6
y ≤ (3/2)x - 3
Watch the sign flip. Dividing by a negative reverses the inequality. This is the single most common error. Circle it. Highlight it. Say it out loud: "Divide by negative, flip the sign."
2. Graph the boundary line
Treat the inequality like an equation. Graph y = (3/2)x - 3.
- Slope: 3/2. Up 3, right 2.
- y-intercept: -3. Plot (0, -3).
- Line type: ≤ means solid. < means dashed.
If the inequality is x > 4 or y ≤ -2, you're graphing a vertical or horizontal line. Same rules. Solid for ≥ or ≤. Dashed for > or < It's one of those things that adds up..
3. Pick a test point not on the line
(0,0) is the gold standard — unless the line passes through the origin. Day to day, then pick (1,0) or (0,1) or (-1,0). Anything easy.
Plug it into the original inequality. Consider this: not the rewritten one. The original It's one of those things that adds up. Practical, not theoretical..
3(0) - 2(0) ≥ 6
0 ≥ 6 → False.
So (0,0) is NOT in the solution set. Shade the other side That's the part that actually makes a difference..
4. Shade the correct half-plane
Lightly. With a pencil. You'll be erasing or layering.
If the test point works → shade toward it.
If it doesn't → shade away from it Small thing, real impact..
Arrow notation helps. Consider this: draw a small arrow on the line pointing toward the shaded side. It saves you later when three shadings overlap and you can't tell which is which That alone is useful..
5. Repeat for every inequality in the system
Same steps. Worth adding: same care. Each inequality gets its own line, its own test, its own shading.
6. Find the intersection
This is the solution to the system. The region where all shadings overlap.
- If it's a polygon, the vertices (corner points) matter. Those are your candidate solutions for optimization problems.
- If the shadings don't overlap at all → no solution. The system is inconsistent.
- If the overlap is unbounded (stretches infinitely) → that's fine. It just means there's no maximum or minimum in that direction.
7. Check a point in the final region (optional but smart)
Pick a point clearly inside the overlap. Test it in every original inequality. If it passes all of them, you're good.
Common Mistakes — And How to Catch Them
Flipping the inequality sign when dividing by a negative
You know this rule. You still miss it. Especially when the negative is buried: -2y ≥ 6 or 4 - 3x < 12.
Fix: Circle every negative coefficient before you divide. Make it a habit.
Using the rewritten inequality for the test point
You rewrote 3x - 2y ≥ 6 as y ≤ (3/2)x - 3. Still, then you test (0,0) in the second version: 0 ≤ -3. Think about it: false. Shade away.
But wait — the original gives 0 ≥ 6. Practically speaking, the original is ground truth. Rounding errors. Same result this time. Also false. And sign errors in rewriting. But not always. Always test the original Worth keeping that in mind. Which is the point..
Shading the wrong side because the line is vertical/horizontal
x > 4. Dashed. False. Test (0,0): 0 > 4? The line is vertical at x = 4. Shade right — toward larger x-values.
y ≤ -2. Horizontal line at y = -2. Solid. Test (0,0): 0 ≤ -2? False. Shade down — toward smaller y-values Worth keeping that in mind..
Fix: For vertical lines, think "x is greater/less than." For horizontal, "y is greater/less than." Shade in the direction the variable goes.
Forgetting dashed vs. solid
≤ and ≥ get solid lines. The boundary is included.
< and > get dashed lines. The boundary is excluded.
This matters for corner points. If two dashed lines meet at a vertex, that vertex
If two dashed lines meet at a vertex
When the boundaries of two inequalities are both excluded (i.e., they are drawn as dashed lines), the intersection point of those lines is not part of the feasible region. Even though the point satisfies the algebraic equations of the lines, it fails the “or‑equal‑to” test because neither inequality includes its boundary That alone is useful..
In practice, this means you should treat such a vertex as a candidate only after you verify that at least one of the bordering inequalities is solid (≤ or ≥). If both are dashed, move a short distance into the overlapping shaded area and check that interior point instead. The true corner of the feasible region will be either a solid‑line intersection or a point where a solid line meets a dashed line.
The official docs gloss over this. That's a mistake.
8. Optimize with the Corner‑Point Method (Linear Programming)
When the final shaded region is bounded, the extreme values of a linear objective function (e.Also, g. , maximize profit or minimize cost) occur at the region’s corner points Simple, but easy to overlook..
- List all corner points – these are the intersections of the boundary lines that lie inside (or on) the feasible region.
- Plug each point into the objective function – compute its value.
- Select the best value – the maximum (or minimum) among the computed values is the optimal solution.
Tip: If a corner involves a dashed line, discard it immediately; the objective cannot achieve its optimum there because the boundary is excluded That's the whole idea..
9. Use Technology Wisely
A graphing calculator or software (Desmos, GeoGebra, MATLAB, etc.) can speed up the process:
- Enter each inequality in slope‑intercept or standard form; the tool will draw the line and shade the correct half‑plane automatically.
- Toggle dashed/solid and color‑code each region to visualize overlaps.
- Find intersections analytically or let the software compute them for you.
Even when using technology, always verify the result by testing a point inside the final region with the original inequalities. This guards against transcription errors or mis‑interpreted inequality signs That's the part that actually makes a difference..
10. Final Review Checklist
Before you declare a system solved, run through these quick checks:
- [ ] Each inequality is graphed with the correct line type (solid for ≤/≥, dashed for </>).
- [ ] A test point confirms the proper half‑plane for every inequality.
- [ ] Arrows point toward the shaded side for each line.
- [ ] All shadings overlap where the solution set resides.
- [ ] Any vertex that belongs to the solution set is noted, and dashed‑only vertices are excluded.
- [ ] For optimization problems, the objective function has been evaluated at every feasible corner.
- [ ] A point inside the final region passes every original inequality.
If any item fails, revisit the corresponding step and correct the error Not complicated — just consistent..
Conclusion
Graphing systems of linear inequalities is a systematic process that blends algebraic manipulation with visual reasoning. By carefully rewriting each inequality, drawing the appropriate boundary line, testing a point to determine the correct half‑plane, and then intersecting the resulting shaded regions, you can reliably identify the feasible set—whether it is a bounded polygon, an unbounded region, or empty. Mastering this technique not only aids in solving textbook problems but also equips you with a powerful tool for real‑world decision‑making scenarios, such as resource allocation, production planning, and constraint‑based optimization.
clear geometric picture—and back again—making complex constraint problems both intuitive and solvable.
