An inequality in x and y describes a region
In 14.2 an inequality in one variable described a piece of the number line. Give the inequality two variables — like y ≤ x + 2 — and it describes a piece of the plane: every point (x, y) whose coordinates make the statement true. The recipe never changes:
Three steps for any region
- Draw the boundary line — the equation you get by replacing the inequality sign with =. Use a solid line for ≤ or ≥ (points on the line count) and a dashed (broken) line for < or > (they do not).
- Test a point not on the line — the origin (0, 0) whenever it is off the line, because it makes the arithmetic trivial.
- Shade according to the result: if the test point satisfies the inequality, its side is the wanted side.
The region y ≤ x + 2 — unwanted side shaded
Several inequalities at once
Most questions give two or three inequalities together. Deal with them one line at a time — draw, test, shade the unwanted side — and the region satisfying all of them is whatever stays clean. Label it R.
Example 1By shading the unwanted regions, show the region R defined by x ≥ 1, y ≥ 2 and x + y ≤ 6.
x = 1 with x + y = 6 → (1, 5)
y = 2 with x + y = 6 → (4, 2)
Region and best-point explorer
The region is x ≥ A, y ≥ B, x + y ≤ C. Move the point to test it, and set an objective P = ux + vy to see which corner of R wins.
Writing the inequalities from a drawn region
The reverse question — “write down the three inequalities that define R” — is pure detective work, one boundary at a time:
1. Name each boundary line
Vertical lines are x = k, horizontal lines are y = k, slanted lines need gradient and intercept (10.1) or two easy points.
2. Pick the sign
Take any point clearly inside R and see which side of each boundary it is on. Then check the line itself: solid → ≤ or ≥, dashed → < or >.
Example 2A region R is bounded by a dashed line through (0, 0) and (4, 4), a solid vertical line through (5, 0), and a solid horizontal line through (0, 1). R lies below the slanted line, left of the vertical line and above the horizontal line. Write down the three inequalities that define R.
Linear programming: the best point in R
Why draw feasible regions at all? Because real questions ask for the best choice that obeys all the constraints — the most profit, the most seats, the least cost. The key fact makes these questions short:
Example 3A hall buys x small tables and y large tables. There is space for at most 15 tables, and the budget allows 3x + 5y ≤ 60 (prices in $10s). A small table seats 4 and a large one seats 6. How many of each should be bought to seat the most people?
maximise S = 4x + 6y
x + y = 15 and 3x + 5y = 60 → 3x + 3y = 45 → 2y = 15 → y = 7.5, x = 7.5
(7, 8): 21 + 40 = 61 > 60 ✗
(5, 9): 5 + 9 = 14 ✓, 15 + 45 = 60 ✓ → S = 20 + 54 = 74
More worked examples
Example 4How many points with integer coordinates lie in the region R of Example 1 (x ≥ 1, y ≥ 2, x + y ≤ 6), including its boundaries?
x = 2: y = 2, 3, 4 (3 points)
x = 3: y = 2, 3 (2 points)
x = 4: y = 2 (1 point)
Example 5A baker makes x cakes and y pies. A cake takes 2 hours and a pie 1 hour, and at most 16 hours are available. At least 3 pies are needed, and the number of cakes must not be more than twice the number of pies. Write down three inequalities (other than x ≥ 0) that model this.
Your turn
Practice set
- Should the boundary line be solid or dashed for (a) y > 3, (b) x ≤ 2?
- Is the point (3, 1) inside the region x + 2y < 6? Show the test.
- Write the inequality for the set of points on or above the line y = 2x − 1.
- The region R has vertices (0, 0), (4, 0) and (0, 8), from x ≥ 0, y ≥ 0, 2x + y ≤ 8. Find the maximum of P = 3x + y on R.
- A question says “shade the unwanted regions and label R”. Why is this convention helpful?
- (a) dashed (strict) (b) solid (includes the line).
- 3 + 2(1) = 5 < 6 ✓ — yes, inside.
- “On or above” includes the line: y ≥ 2x − 1 (solid boundary).
- P at the vertices: P(0,0) = 0, P(4,0) = 12, P(0,8) = 8 → maximum P = 12 at (4, 0).
- With three or more inequalities, shading the wanted side each time buries the answer under overlapping shading; shading the unwanted sides leaves R clean and easy to read — and the label R tells the examiner exactly which region you mean.
Key points to remember
- Solid line for ≤ / ≥, dashed line for < / > — the line style is a mark on its own.
- Decide the side by testing a point — the origin whenever it is not on the line.
- Follow the instruction to shade the unwanted regions and always label R.
- Find the corners of R by solving boundary pairs as simultaneous equations.
- P = ux + vy is biggest or smallest at a vertex of R — evaluate P at every corner.
- If the answer must be whole numbers and the best vertex is not, test nearby integer points inside R.
- Translating words: at least → ≥, at most → ≤, “x no more than twice y” → x ≤ 2y.
Where next?
🎥 Take the interactive module
Graphs, Curves & Feasible Regions — the full teaching module for this topic, with real past-paper questions and mark schemes.
✏️ Practise exam questions
Linear Programming — 25 exam-style questions worth 98 marks, with full answers and the mark scheme.
Progress is saved on this device only and appears on the notes home page.