A linear inequality describes a region of the coordinate plane. A system of inequalities describes the points satisfying every constraint at once. This is how limits on money, time, capacity, or minimum requirements become a picture of possible choices.
Start with the boundary equation
For the boundary is the line Points on the line make the two sides equal. Points below it have smaller y-values at the same , so they satisfy the inequality.
Draw a solid boundary for or because equality is allowed. Draw a dashed boundary for or because equality is excluded. For an inequality not already solved for , test a point off the boundary, often If it satisfies the inequality, shade the side containing that point. If not, shade the other side.
For example, has boundary The origin gives which is false. Shade the side away from the origin, above the dashed line. A point on the line cannot help you choose a side.
Example: plan a constrained purchase
Suppose notebooks cost 4 dollars each and folders cost 2 dollars each. You can spend at most 20 dollars and need at least 3 folders. The constraints are
The budget boundary is Shade below it. The folder requirement is the horizontal line shaded above. Nonnegative quantities restrict us to the first quadrant. Their overlap is the feasible region.
The point works: the purchase costs dollars and includes at least 3 folders. The point fails because it costs 22 dollars. Meeting one condition is not enough.
The boundary intersection satisfies giving That is a geometric corner of the region, but a purchase must use whole-number coordinates. With at least three folders, at most three notebooks can actually be bought. Continuous graph regions and discrete real choices are related, but they are not identical.
Budget
Minimum folders
Feasible purchases lie above y = 3, below y = 10 − 2x, and to the right of x = 0. Whole-number purchases are selected from this region.
Feasible purchases lie above , below , and to the right of . Whole-number purchases are selected from this region.
Describe this figure
Feasible purchases lie above , below , and to the right of . Whole-number purchases are selected from this region.
Curves: Budget; Minimum folders.
Marked points: Feasible: filled marker at (2, 4); Over budget: filled marker at (4, 3).
Why overlap is essential
Each inequality gives its own half-plane. A system joined by “and” requires their intersection, not the union of all shaded areas. If one constraint says and another says there are no common points. The system has no solution.
A practical check is to select one point inside the proposed overlap and substitute it into every original inequality. Also test boundary points separately. A corner on even one strict boundary is excluded, despite possibly lying on other solid boundaries.
Example: reversing an inequality correctly
For subtract and divide by Division by a negative reverses the comparison:
The boundary is solid, and the region lies above it. Test in the original: is true. The origin is indeed above the line, confirming the direction. Forgetting the reversal would shade the wrong half-plane.
Vertical constraints work similarly. The inequality shades left of the dashed vertical line There is no need to solve that inequality for .
Try it yourself
Does satisfy and Does Decide whether each boundary is solid or dashed before checking the points.
Answer: All boundaries are solid. For and so it works. For the two values are 6 and 7, so it also works, exactly on both sloping boundaries.
What to remember
Draw each boundary, include or exclude it correctly, choose the appropriate side, then keep only the overlap. Finally apply real-world restrictions such as whole-number counts.