A bake sale sells muffins for 2 dollars and cookies for 1 dollar. The table has room for at most 40 items, and the club wants to take in at least 60 dollars. Many combinations of muffins and cookies meet both goals and many do not, and a graph can show all of the good ones at once as a shaded region. The SAT asks you to read such regions, match them to inequalities and pick points that lie inside.
See also Inequalities in Two Variables in Precalculus.
Key terms
Constraint
Definition A constraint is a condition that the variables of a problem must satisfy. Here constraints are linear inequalities in and , written as or with , or , where and are real and not both zero. A point satisfies a constraint when substituting its coordinates makes the inequality true.
In plain words A constraint is a rule like “at most 40 items” turned into an inequality.
Example With muffins and cookies, the bake sale has the constraints
The counts cannot be negative, which gives two more constraints, and . They come from the context, so they must be written down. The algebra does not supply them on its own.
Boundary line
Definition The boundary line of the inequality (or with , or ) is the line . It is drawn solid when the symbol is or , because its points satisfy the inequality, and dashed when the symbol is or , because its points do not.
In plain words Replace the inequality symbol by an equals sign to get the edge. Solid means the edge belongs to the answer, dashed means it does not.
Example The inequality has the boundary line , through with slope , drawn dashed. The point lies on that line, and is false, so it is not a solution. For the same line is solid and is a solution.
Half-plane
Definition A line divides the plane into two half-planes, one on each side. The solution set of a single linear inequality in and is one of the two half-planes of its boundary line, with the line included for and and excluded for and . When the inequality is solved for , the solutions of lie above the line and those of lie below it.
In plain words One inequality shades one whole side of a line. In the form you shade above, and in you shade below.
Example Take . Solving for means dividing by , which reverses the symbol,
The solutions lie above the dashed line through and . A careless reader who sees in the original and shades below would get exactly the wrong side.
Test point
Definition A test point is a point not on the boundary line that you substitute into the inequality to decide which half-plane is the solution set. If it satisfies the inequality, its whole half-plane does, and if not, the other half-plane does. The origin is a convenient test point whenever the boundary line does not pass through it.
In plain words Pick an easy point off the line and try it. One test settles the whole side.
Example Graph . The boundary line passes through and , drawn solid. Testing gives , which is false, so the solution is the half-plane that does not contain the origin, the side above the line. For the origin lies on the boundary, so test instead. It gives , true, so shade the side containing , below the line.
Intersection of half-planes
Definition For a system of inequalities, a point is a solution exactly when it satisfies every inequality at the same time. So the solution set of the system is the intersection of the separate solution sets, the points that lie in all of the half-planes. It can be empty, as for and , whose boundary lines are parallel.
In plain words Shade each inequality and keep only the part where all the shadings overlap. Satisfying most of the conditions is not enough.
Example Consider and . The origin satisfies both, since and , so it is in the solution set of the system. The point satisfies the first, , but fails the second, since is false. The point satisfies the second, , but fails the first, since is false. Each of these two points sits in one shaded half-plane and outside the other, so neither is a solution.
Feasible region
Definition The feasible region of a set of constraints is the set of all points that satisfy every constraint. It is the intersection of the solution sets of the constraints. A point in it is a feasible point. A point on an edge of the region belongs to it only when the constraint for that edge is inclusive, and a strict constraint leaves its edge out. The region is determined by the constraints alone, so the edges of a graph window, a grid that stops or a picture of only the first quadrant add no restrictions of their own.
In plain words The feasible region is the set of all choices that break no rule. If a rule is not written as a constraint, it is not part of the region, however the picture is cropped.
Example For the bake sale, the boundary lines and meet where subtracting gives , so at . Together with the feasible region is the triangle with corners , and , edges included because every constraint is inclusive.
| Point | Feasible | ||
|---|---|---|---|
| , true | , true | yes | |
| , false | , true | no | |
| , true | , true | yes |
Only whole numbers of muffins and cookies make sense, so the real choices are the whole number points in the triangle. In the Desmos graphing calculator you can enter each inequality on its own line, for example , and each one is shaded. The feasible region is the part shaded by every inequality. Enter and too, because zooming the window to the first quadrant does not add them as constraints.
Check yourself
- Which point is a solution to the system and ? (A) (B) (C) (D)
Show the answer
The answer is (C), since and are both true. Choice (B) satisfies the first inequality, , but lies on the dashed line , and is false. Choice (A) fails both inequalities, and choice (D) fails the second, because is false.
- The graph of an inequality has a dashed boundary line through and , and the shaded side contains the origin. Which inequality is it? (A) (B) (C) (D)
Show the answer
The answer is (A). The line through and is , since both points satisfy it. The origin gives , true, so the shaded side is . Choice (B) would have a solid line, choice (C) shades the side away from the origin, and choice (D) has the intercepts swapped, since its line passes through and .
- A student buys notebooks and folders. She buys at most items in all, and at least twice as many folders as notebooks, so and , with and . What is the greatest number of notebooks she can buy?
Show the answer
The answer is . From the total satisfies , and it is at most , so and . The point meets every constraint, since and . With notebooks she would need at least folders, items in all.