Skip to content
MathClicksIGCSE← All notes Cambridge IGCSE® Mathematics 0580 Extended Chapter 14 — Further Solving of Equations and Inequalities

14.3  Regions and Linear Programming

Inequalities in two variables as regions of the plane — drawing boundaries solid or dashed, shading correctly, and finding the best point in the feasible region.

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

0 2 4 6 8 2 4 6 shaded = NOT wanted (y > x + 2 here) wanted region: y ≤ x + 2 solid line y = x + 2 test (0,0): 0 ≤ 0 + 2 ✓
Cambridge’s shading convention IGCSE questions say “shade the unwanted regions” and label the region you want R. That way, after several inequalities the answer region is the part left clean. Read the question’s instruction — and whichever way you shade, label R.

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.
1
x ≥ 1: the boundary is the vertical line x = 1, solid. Points with x ≥ 1 lie to its right, so shade the strip to the left as unwanted.
2
y ≥ 2: boundary is the horizontal line y = 2, solid; shade below it.
3
x + y ≤ 6: boundary x + y = 6 is the solid line through (6, 0) and (0, 6). Test the origin: 0 + 0 ≤ 6 is true, so the origin’s side is wanted — shade above the line. boundary points: (6, 0) and (0, 6)  ·  test (0,0): 0 ≤ 6 ✓
4
The clean triangle is R. Its corners — found by intersecting the boundaries in pairs — are: x = 1 with y = 2 → (1, 2)
x = 1 with x + y = 6 → (1, 5)
y = 2 with x + y = 6 → (4, 2)
R is the triangle with vertices (1, 2), (1, 5) and (4, 2), all boundaries solid
Exam tip Writing the vertex coordinates on the diagram is never wasted — the follow-up part almost always needs them.

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.
1
The slanted line through (0, 0) and (4, 4) is y = x. R is below it and the line is dashed — strict inequality. y < x
2
The vertical line is x = 5. R is to its left and the line is solid. x ≤ 5
3
The horizontal line is y = 1. R is above it and the line is solid. y ≥ 1
y < x,   x ≤ 5,   y ≥ 1
Watch out The dashed/solid detail is a whole mark. Copy each boundary’s style before writing the sign — a dashed line with ≤ is wrong even if the side is right.

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:

Key idea A quantity of the form P = ux + vy takes its largest and smallest values over a feasible region at a vertex (corner) of the region. So: find the corners, evaluate P at each, pick the winner. If the answer must be a whole number and the best corner is not, test the integer points beside it that are still inside R.
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?
1
Constraints and objective. x + y ≤ 15,  3x + 5y ≤ 60,  x ≥ 0,  y ≥ 0
maximise S = 4x + 6y
2
Find the vertices of R. (0, 0),  (15, 0),  (0, 12)  and the crossing of the two slanted boundaries:
x + y = 15 and 3x + 5y = 60 → 3x + 3y = 45 → 2y = 15 → y = 7.5, x = 7.5
3
Evaluate S at each vertex. S(0,0) = 0  S(15,0) = 60  S(0,12) = 72  S(7.5, 7.5) = 30 + 45 = 75
4
Tables come in whole numbers, and (7.5, 7.5) is not allowed — so test the integer points near it that satisfy both constraints. (8, 7): 8 + 7 = 15 ✓, 24 + 35 = 59 ≤ 60 ✓ → S = 32 + 42 = 74
(7, 8): 21 + 40 = 61 > 60 ✗
(5, 9): 5 + 9 = 14 ✓, 15 + 45 = 60 ✓ → S = 20 + 54 = 74
74 people — for example 8 small and 7 large tables (5 and 9 also seats 74)
Why check integers? The pure maximum 75 sits at a corner the real world cannot use. Cambridge loves this twist — state the vertex value, then show the integer check.

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?
1
All three boundaries are solid, so boundary points count. Fix each x in turn and list the allowed y values (needing 2 ≤ y ≤ 6 − x). x = 1: y = 2, 3, 4, 5  (4 points)
x = 2: y = 2, 3, 4  (3 points)
x = 3: y = 2, 3  (2 points)
x = 4: y = 2  (1 point)
2
Beyond x = 4, the ceiling 6 − x drops below 2, so nothing qualifies. Total: 4 + 3 + 2 + 1 = 10
10 integer points
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.
1
Time: 2 hours per cake and 1 per pie, 16 available. 2x + y ≤ 16
2
“At least 3 pies”. y ≥ 3
3
“Cakes not more than twice the pies”. x ≤ 2y
2x + y ≤ 16,   y ≥ 3,   x ≤ 2y
Translation traps “At least” means ≥, “at most / no more than” means ≤ — and “x is not more than twice y” is x ≤ 2y, not 2x ≤ y. Read each phrase twice.

Your turn

Practice set

  1. Should the boundary line be solid or dashed for (a) y > 3, (b) x ≤ 2?
  2. Is the point (3, 1) inside the region x + 2y < 6? Show the test.
  3. Write the inequality for the set of points on or above the line y = 2x − 1.
  4. 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.
  5. A question says “shade the unwanted regions and label R”. Why is this convention helpful?

  1. (a) dashed (strict)  (b) solid (includes the line).
  2. 3 + 2(1) = 5 < 6 ✓ — yes, inside.
  3. “On or above” includes the line: y ≥ 2x − 1 (solid boundary).
  4. P at the vertices: P(0,0) = 0, P(4,0) = 12, P(0,8) = 8 → maximum P = 12 at (4, 0).
  5. 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?

✅ Mark scheme All notes

Progress is saved on this device only and appears on the notes home page.