Regions and linear programming
A region on a graph shows every point that satisfies a set of inequalities. Linear programming finds the best point in that region.
Drawing the boundary
Use a solid line for ≤ or ≥ (the line is included).
Use a dashed line for < or > (the line is not included).
Choosing the side
For y < 2x + 1: 0 < 1 is true, so the side containing (0, 0) is wanted.
Shade the wanted or unwanted side, and say which you have done.
Linear programming
Region x ≥ 0, y ≥ 0, x + 2y ≤ 8, 3x + y ≤ 9 has vertices (0, 0), (3, 0), (0, 4) and (2, 3).
| Vertex | P = x + y |
|---|---|
| (0, 0) | 0 |
| (3, 0) | 3 |
| (0, 4) | 4 |
| (2, 3) | 5 |
Find the maximum of P = 2x + 3y in the region x ≥ 0, y ≥ 0, x + 2y ≤ 8, 3x + y ≤ 9.
- Vertices: (0, 0), (3, 0), (0, 4), (2, 3)
- P = 0, 6, 12, 13
Answer: Maximum P = 13 at (2, 3)
Solid line for ≤ or ≥, dashed for < or >. Test a point to pick the side. Maximum and minimum values occur at vertices of the region.
- Not “(2, 1)”. y > x fails: 1 is not greater than 2.
- Not “(3, 3)”. x + y = 6, which is more than 4.
Try two quick questions
See if it has sunk in. Answers are marked straight away.
2 more questions
Try each one, then tap to check.
When is the boundary of a region drawn as a solid line?
- Only for horizontal lines
- For < or >
- For ≤ or ≥
- When the region is bounded
Show the answer
Answer: For ≤ or ≥
≤ and ≥ include the line, so it is solid.
Which point lies in the region x + y < 6 and y ≥ 2x?
- (2, 5)
- (2, 3)
- (3, 1)
- (1, 3)
Show the answer
Answer: (1, 3)
(1, 3): 1 + 3 = 4 < 6 and 3 ≥ 2.
Check you have got it
Answer 6 quick questions with instant marking. If you get one wrong, GCSE-ready shows you why and gives you another go. It is free, and you do not need an account.
Facts checked against the sources below, 17 October 2026. Last updated 2 October 2026. Spotted a mistake? Tell us and we will fix it.