A boundary line on a graph is the line that divides the coordinate plane into two regions when you’re graphing a linear inequality. It works exactly like the line in a linear equation, but instead of being the entire answer, it marks the edge of a shaded region where all the solutions live. Think of it as a fence: everything on one side satisfies the inequality, and everything on the other side doesn’t.
How a Boundary Line Works
When you graph a simple equation like y = 2x + 3, you get a single line, and every point on that line is a solution. But when you change that equal sign to an inequality (like y > 2x + 3 or y ≤ 2x + 3), suddenly the solutions aren’t just on the line. They’re an entire region of the graph, either above or below it. The boundary line is what separates the solution region from the non-solution region.
To draw the boundary line, you temporarily treat the inequality as if it were a regular equation. Replace the inequality symbol with an equal sign, then graph the line using whatever method you’re comfortable with, whether that’s plotting points, using a table, or working from slope-intercept form (y = mx + b, where m is the slope and b is where the line crosses the y-axis).
Solid Lines vs. Dashed Lines
The type of line you draw tells the reader whether the points on the boundary itself count as solutions. This depends on the inequality symbol:
- Solid line: Used for ≤ (less than or equal to) and ≥ (greater than or equal to). The “or equal to” part means points sitting directly on the line are included in the solution set.
- Dashed line: Used for < (strictly less than) and > (strictly greater than). Points on the line are not part of the solution. The dashed style visually signals that the boundary is a limit the solutions approach but never touch.
This is one of the most common mistakes in graphing inequalities: using a solid line when it should be dashed, or vice versa. Always check the symbol before you draw.
Which Side to Shade
Once the boundary line is on the graph, you need to figure out which of the two regions contains the solutions. There are two reliable ways to do this.
The quick rule works when your inequality is already in slope-intercept form (solved for y). If y is greater than mx + b, shade above the line. If y is less than mx + b, shade below it. “Above” and “below” here mean exactly what they look like on the graph: higher y-values are above, lower y-values are below.
The test point method works in any situation and is a good backup when the quick rule feels uncertain. Pick any point that isn’t on the boundary line itself. The origin (0, 0) is the easiest choice as long as the line doesn’t pass through it. Plug the coordinates into the original inequality. If the statement comes out true, shade the side that contains your test point. If it comes out false, shade the opposite side.
For example, with y > 2x + 3, test the point (0, 0): is 0 > 2(0) + 3? That simplifies to 0 > 3, which is false. So you shade the side of the line that does not contain the origin.
Horizontal and Vertical Boundary Lines
Not every boundary line has a slope. Two special cases come up regularly.
A horizontal boundary line looks like y = c, where c is some constant (for example, y = 4). This line runs straight across the graph. For y > 4, you shade above the line. For y < 4, you shade below it. The logic is straightforward: "greater than" means higher on the graph.
A vertical boundary line looks like x = c (for example, x = 2). This line runs straight up and down. For x > 2, you shade to the right of the line, because values to the right represent larger x-values. For x < 2, you shade to the left.
Systems of Inequalities and Overlapping Regions
Things get more interesting when you graph two or more inequalities on the same coordinate plane. Each inequality produces its own boundary line and shaded region. The solution to the entire system is the overlap, the area where all the shaded regions stack on top of each other. Every point in that overlapping zone satisfies every inequality at once.
This concept is the foundation of a technique called linear programming, which businesses and engineers use to optimize decisions. For instance, a cheese company trying to maximize profit might face constraints like limited supplies of different cheese types. Each constraint becomes an inequality with its own boundary line. The region where all the constraints overlap (called the feasible region) represents every possible production plan the company could actually execute. The best solution, the one that maximizes profit, always sits at a corner point where boundary lines intersect.
In one textbook example, a company’s constraints produce three boundary lines: 30x + 12y = 6000, 10x + 8y = 2600, and 4x + 8y = 2000. Each line clips off part of the graph, and the feasible region is the polygon-shaped area that remains. The mathematical property behind this is that intersecting half-planes always produce a shape with no inward curves, which guarantees the optimal solution sits at a vertex.
Common Mistakes to Avoid
The most frequent errors when working with boundary lines are mechanical, not conceptual. First, forgetting to flip the inequality sign when you multiply or divide both sides by a negative number. This changes which side of the boundary line gets shaded and leads to a completely wrong solution region. Second, using a solid line for strict inequalities (< or >) or a dashed line for inclusive ones (≤ or ≥). Third, skipping the test point step and guessing which side to shade. The guess is wrong about half the time, and the test takes only a few seconds.
If your boundary line passes through the origin, pick a different test point. Something simple like (1, 0) or (0, 1) works just as well and keeps the arithmetic easy.