Graphing Inequalities
Studying this course? Keep your progress in one place.
Key facts
- Every inequality has a boundary line: replace the sign with .
- and give a solid line; and give a dashed line.
- Use a test point (often the origin) to decide which side to shade.
- For several inequalities the solution is where all regions overlap.
- The maximum or minimum of an expression over a feasible region occurs at a vertex.
The boundary line
Replace the inequality sign with an equals sign and draw that line.
has boundary line . Rearrange to a plottable form or find two points, then draw the line across the grid.
Vertical and horizontal lines work the same way: is vertical, is horizontal.
What is the boundary line of ?
Solid or dashed
Solid when the line is included (≤ or ≥), dashed when it is not (< or >).
A solid line means points on it satisfy the inequality; a dashed line only marks the edge.
Memory trick: and have a line under the symbol, so the line is drawn. and have none, so it is dashed.
| ≤ or ≥ | < or > | |
|---|---|---|
| Boundary line | Solid | Dashed |
| Points on the line | Included | Not included |
≤ or ≥
- Boundary line:
- Solid
- Points on the line:
- Included
< or >
- Boundary line:
- Dashed
- Points on the line:
- Not included
Which boundary line is used for ?
Which side to shade
Test a point not on the line: if it satisfies the inequality, shade its side.
Use a test point:
- Pick a point clearly not on the line, such as the origin.
- Substitute it into the original inequality.
- If true, that side is the region; if false, it is the other side.
Shortcut: or is above the line, or below; is to the right, to the left.
Worked example
Which side of satisfies ?
- 1
Test the origin: is ?
- 2
Yes, it is true, so the origin is in the region: shade below the line.
Does the region contain the origin?
Several inequalities
Find the region for each inequality; the answer is where all of them overlap.
For , and , draw each boundary line, decide each region with a test point, then take the intersection.
Exams often ask you to shade the unwanted regions and leave the required region blank, labelled . Check which convention the question uses.
Which point satisfies , and ?
Feasible regions
The feasible region satisfies every inequality; its corners are found by solving pairs of boundary lines.
The feasible region satisfies every inequality. Its corners are called vertices. To find one, solve the two boundary equations simultaneously, then check it satisfies the other inequalities.
In optimisation, the maximum or minimum of an expression such as occurs at a vertex, so evaluate it at each vertex and compare.
Worked example
Find the vertex where meets , then maximise over the region.
- 1
Substitute : , so the vertex is . The others are and .
- 2
Evaluate : 3 at , 13 at , 18 at .
Where does the maximum or minimum of an expression occur in linear programming?
Try an exam question
The region satisfies , and . Find the greatest value of for points in .
[4 marks]
- [1]Boundary lines , and .
- [1]Vertices of : , and .
- [1]Values of : , and .
- [1]Greatest value is , at .
That's the notes covered.
Carry on to the next subtopic.
Try a question
Does the point lie within region R?
1 mark, marked against the mark scheme
Does the point lie within region R?
1 mark, marked against the mark scheme