Graphical representation of linear inequalities

Edexcel International GCSE Further Pure Mathematics· 3E· 20 min read

1. Drawing Boundary Lines for Linear Inequalities★★☆☆☆⏱ 5 min

✓ Calculator OK

📘 Definition

Boundary Line

The straight line representing the equality version of a linear inequality, which separates the coordinate plane into two half-planes. Solid lines are used for ≤/≥ (points on the line satisfy the inequality), dashed lines for </> (points on the line do not satisfy).

Example:

The inequality $2 x + y \leq 4$ has a solid boundary line $2 x + y = 4$ .

To draw a boundary line, first rearrange the inequality into the form $y = m x + c$ or use the intercept method: find x and y intercepts by setting y=0 and x=0 respectively. Plot two points to draw the line, then check if it should be solid or dashed based on the inequality symbol.

📐 Worked Example

Draw the boundary line for the inequality $3 x - 2 y > 6$

1
1. Write the equality version of the inequality: $3 x - 2 y = 6$
2
1. Find the x-intercept: set $y = 0$ , so $3 x = 6$ → $x = 2$ , giving point (2, 0)
3
1. Find the y-intercept: set $x = 0$ , so $- 2 y = 6$ → $y = - 3$ , giving point (0, -3)
4
1. The inequality uses > (strict), so draw a dashed line connecting (2,0) and (0,-3), and label the line with its equation $3 x - 2 y = 6$

Exam tip:

Always label boundary lines with their full equation: you will lose marks if you omit labels in your exam.

2. Identifying and Shading Feasible Regions★★★☆☆⏱ 6 min

✓ Calculator OK

📘 Definition

Feasible Region

The set of all points on the coordinate plane that satisfy all given linear inequalities simultaneously.

Example:

For constraints $x \geq 0$ , $y \geq 0$ , $x + y \leq 3$ , the feasible region is the triangle with vertices at (0,0), (3,0) and (0,3).

To find which side of a boundary line to shade, pick a test point not on the line (the origin (0,0) is easiest if it is not on the boundary line). Substitute the x and y values of the test point into the inequality: if the resulting statement is true, shade the side containing the test point; if false, shade the opposite side. If you have multiple inequalities, the feasible region is the area shaded by all constraints.

📐 Worked Example

Shade the feasible region satisfying $x + y \geq 2$ , $x \leq 3$ , $y \leq 4$

1
1. Draw all boundary lines: $x + y = 2$ (solid, ≥), $x = 3$ (solid, ≤), $y = 4$ (solid, ≤)
2
1. Test (0,0) for $x + y \geq 2$ : $0 + 0 = 0 \geq 2$ is false, so shade the side of $x + y = 2$ that does NOT contain (0,0)
3
1. Test (0,0) for $x \leq 3$ : $0 \leq 3$ is true, so shade the side of $x = 3$ containing (0,0)
4
1. Test (0,0) for $y \leq 4$ : $0 \leq 4$ is true, so shade the side of $y = 4$ containing (0,0)
5
1. The overlapping shaded area is the feasible region: mark it clearly with an R or cross-hatching as directed by the question.

3. Solving Simple Linear Programming Problems★★★★☆⏱ 6 min

✓ Calculator OK

📘 Definition

Linear Programming

Objective function is usually written as $P = a x + b y$ , where a and b are constants.

A method used to find the maximum or minimum value of a linear objective function, subject to a set of linear inequality constraints.

For Edexcel IGCSE Further Pure Math problems, the optimal (maximum or minimum) value of the objective function will always lie at one of the vertices (corner points) of the feasible region. To solve, first identify all vertices of the feasible region, substitute each vertex into the objective function, then select the vertex that gives the required maximum or minimum value.

📐 Worked Example

A factory makes chairs (x) and tables (y). Constraints are $x + 2 y \leq 10$ , $x \geq 0$ , $y \geq 0$ . Profit per chair is $10, per table is $15. Find the maximum possible profit.

1
1. Define the objective function: $P = 10 x + 15 y$
2
1. Draw the feasible region, identify its vertices: (0,0), (10, 0), (0,5)
3
1. Substitute each vertex into the profit function:
4
$P(0,0) = 10(0) + 15(0) = 0$
5
$P(10,0) = 10(10) + 15(0) = 100$
6
$P(0,5) = 10(0) + 15(5) = 75$
7
1. The maximum profit is $100, achieved when 10 chairs and 0 tables are made.

Exam tip:

Even if you can estimate the optimal point by eye, always substitute all vertices to confirm: you will get method marks even if your graph is slightly inaccurate.

4. Exam Presentation Rules for Graphical Inequalities★★☆☆☆⏱ 3 min

✓ Calculator OK

Following presentation rules is critical to score full marks in this topic, as examiners penalize missing labels or unclear shading.

Use a ruler to draw all straight boundary lines: freehand lines will lose marks.
Label every boundary line with its full equation.
Use solid lines for ≤/≥ and dashed lines for </>.
Clearly indicate the feasible region, either by shading it or shading the unwanted regions and marking the feasible region with an R.
Show all test point working when justifying your shaded region.

✓ Quick check

What type of line should you use for the inequality $4 x - 3 y < 12$ ?
- Solid line
- Dashed line
- Either is acceptable
Reveal answer
Dashed line —
Strict inequalities < or > use dashed lines, as points on the line do not satisfy the inequality.
Where is the optimal point for a linear objective function located?
- At the centre of the feasible region
- At a vertex of the feasible region
- Along any edge of the feasible region
Reveal answer
At a vertex of the feasible region —
For all linear programming problems in this syllabus, the optimal value is always at a corner vertex of the feasible region.

5. Common Pitfalls

Wrong move:

Using a solid line for strict inequalities (< or >)

Why:

Strict inequalities do not include points on the boundary line, so solid lines incorrectly imply points on the line are valid solutions.

Correct move:

Use a dashed line for < and >, solid line only for ≤ and ≥.

Wrong move:

Shading the wrong side of the boundary line because you didn't test a point

Why:

Rearranging inequalities incorrectly can lead to reversing the inequality sign by mistake, leading to shading the wrong region.

Correct move:

Always test a point not on the boundary line (preferably (0,0) if possible) to confirm which side to shade.

Wrong move:

Forgetting to label boundary lines with their equations

Why:

Exam mark schemes explicitly award marks for correctly labelled boundary lines; missing labels lead to lost marks even if the line is drawn correctly.

Correct move:

Write the full equation of each boundary line next to the line as soon as you draw it.

Wrong move:

Calculating the optimal point by eye instead of substituting all vertices

Why:

Slight inaccuracies in graph drawing can make the optimal vertex look closer to the maximum/minimum than it is, leading to incorrect answers.

Correct move:

List all vertices of the feasible region, substitute each into the objective function, and select the value that meets the requirement (max or min).

Wrong move:

Forgetting non-negativity constraints (x ≥ 0, y ≥ 0) in linear programming problems

Why:

Most real-world linear programming problems involve quantities that cannot be negative, so omitting these constraints expands the feasible region incorrectly.

Correct move:

Always check if the problem context (number of items, time, money) requires x and y to be non-negative, and add these constraints explicitly.

6. Quick Reference Cheatsheet

Task	Step-by-Step Action
Draw boundary line	Write equality form; 2. Find intercepts; 3. Draw solid (≤/≥) or dashed (</>); 4. Label equation
Shade correct region	Pick test point not on line; 2. Substitute into inequality; 3. Shade side where test point works; 4. Overlap for multiple constraints
Solve linear programming	Define objective function; 2. Identify all feasible region vertices; 3. Substitute each vertex into objective; 4. Select max/min value

7. Frequently Asked

Do I use a solid or dashed line for strict inequalities?

Use a dashed line for < or >, as points on the line do not satisfy the inequality. Use a solid line for ≤ or ≥, where points on the line are valid solutions.

How do I check which side of the boundary line to shade?

Pick a test point not on the line (the origin (0,0) is easiest if it is not on the boundary). Substitute its coordinates into the inequality: if true, shade the side containing the point; if false, shade the opposite side.

Where will the optimal point for a linear objective be located?

For all linear programming problems in this syllabus, the optimal (maximum or minimum) value will always be at a vertex (corner point) of the feasible region.

Going deeper

externalOfficial Edexcel 4PM1 SpecificationAvailable on the Pearson Edexcel website

What's Next

Now that you have mastered graphical representation of linear inequalities and basic linear programming, you are ready to move on to more advanced inequality topics in the Edexcel IGCSE Further Pure Math syllabus. This topic forms the foundation for applied problem-solving questions that often combine with coordinate geometry and algebraic manipulation in exam papers. Make sure you practice past paper questions to perfect your graph drawing speed and accuracy, as presentation is key to scoring full marks in this topic. You should also review algebraic methods for solving systems of inequalities to cross-verify your graphical solutions and avoid errors in high-pressure exam settings.