Inequalities and Linear Programming
Solve linear and quadratic inequalities and combine them, shade a region from inequalities, find its corners, and find the greatest or least value of an expression in it.
In the exam for Edexcel Further Pure Maths 4PM1 · 14 real past-paper questions below
اقرأ هذا الدرس مشروحاً بالعربي ←
Plans with limits
A bakery has only so much flour and so many hours. Each limit is an inequality. Together they mark out every plan the bakery can actually make. Which plan earns the most? That question is called linear programming.
Here, “programming” means planning, not computer code. The plan you want is always at a corner of the allowed region, and this lesson shows you why.
First: solve inequalities in one letter, x. These are the 4PM1 questions that end with “both”.
Then: inequalities in x and y. You draw lines, shade a region R, find its corners and test an expression P.
Key idea
Linear programming grew up in the 1930s and 1940s to plan factories and wartime supplies. Leonid Kantorovich, one of its founders, shared the 1975 Nobel Prize in Economics for this work.
Inequalities in x
A linear inequality is solved like an equation. Do the same thing to both sides, with one extra rule.
Rule
If you multiply or divide both sides by a negative number, flip the inequality sign. For example, gives .
Worked example
- 1
Find the set of values of x for which .
- 2
— Expand the bracket.
- 3
— Take x from both sides and add 6.
- 4
— Divide by 2. It is positive, so the sign stays.
For a quadratic inequality, collect everything on one side first, so the other side is 0. The terms may be on both sides.
Worked example
- 1
Find the set of values of x for which .
- 2
— Move every term to the left.
- 3
— The critical values.
- 4
— The parabola is below 0 between its roots.
Rule
When the x² number is positive: less than 0 gives one piece, between the critical values; greater than 0 gives two pieces, outside them, like or .
Worked example
- 1
Find the values of x for which both and .
- 2
— Solve the linear one: .
- 3
— The quadratic one, from before.
- 4
— “Both” means the overlap. Draw both on a number line and keep the part covered twice.
Common mistake
Dividing by a negative and keeping the sign. gives .
Key idea
For “both”, draw the two answers on one number line. The answer is only where they overlap.
Draw and shade R
Now the inequalities have x and y. Each one is a line on the graph, with the allowed side shaded. The region where all of them are true is called R.
Steps
- 1
Draw each line. Two quick points: put , then put .
Use a solid line for or , and a dashed line for or .
Pick a test point not on the line, usually (0, 0). Put it into the inequality.
If it is true, R is on the side of the test point. If it is false, R is on the other side.
Shade, and label the region R.
Worked example
- 1
Show the region R where , and .
- 2
— Two points for the first line.
- 3
— Put x = 0: 2y = 10. Put y = 0: x = 10.
- 4
— A horizontal line through (0, 1).
- 5
— Put (0, 0) into the first two. Both are true, so R is on the origin side of these two lines.
- 6
— (0, 0) fails here, so R is above the line y = 1.
- 7
— The three lines close off a triangle. Label it R.
Rule
4PM1 accepts shading the region you want or the parts you do not want. Either way, R must be one closed region and clearly labelled.
Common mistake
Plotting through (0, 10). With , you get , so .
Key idea
Every line splits the page in two. One test point tells you which half you keep.
Corners of R
The corners of R are called vertices. Each one is where two boundary lines meet. You can read them from an accurate graph, but solving the equations is safer.
Worked example
- 1
Find the vertices of the triangle R from before.
- 2
— Put y = 1 into the first line. Vertex (−1, 1).
- 3
— Substitute into .
- 4
— Vertex (2, 4).
- 5
— Put y = 1 into . Vertex (8, 1).
Common mistake
Using a crossing point that is not a corner of R. Only points where two lines meet on the edge of R count.
Key idea
Vertices come from simultaneous equations: two lines, one point. Write each one as coordinates.
Greatest and least values
The question gives an expression such as and asks for its greatest or least value for points in R. Here is why the answer is at a vertex.
Each value of P is a straight line, like or . All these lines are parallel. As P grows, the line slides across the page. The last point of R it touches is always a corner.
Steps
- 1
Find every vertex of R.
Work out P at each vertex.
The biggest result is the greatest value. The smallest is the least value.
Worked example
- 1
For points in R, find the greatest value of .
- 2
— Put the first vertex into P.
- 3
— The second vertex.
- 4
— The third vertex.
- 5
— The greatest value is 14, at (2, 4).
Worked example
- 1
For points in R, find the least value of .
- 2
— At (−1, 1), (2, 4) and (8, 1).
- 3
— The least value is −4, at (−1, 1).
Rule
A second method is the objective line: draw a line and slide it parallel across R. Testing every vertex is quicker and safer, and the mark scheme accepts both.
Common mistake
Testing only one or two vertices, or giving the point instead of the value. Test them all, then write the value of P.
Key idea
Corners only. Put each vertex into P, then pick the largest or smallest.
Which step? Read the question
These questions follow the same pattern every year. Read each part and use the right tool.
| You see | You do |
| A linear inequality in x | Solve like an equation; flip the sign if you divide by a negative |
| A quadratic inequality | Collect to one side, find the critical values, sketch the parabola |
| “Both … and …” | Draw both on a number line; keep the overlap |
| “Draw the line with equation …” | Two points: put x = 0, then y = 0 |
| “Show, by shading, the region R” | Test (0, 0) for each line, shade, label R |
| “Find the greatest (or least) value of P” | Find every vertex, put each into P, compare |
Common mistake
Answering “least” with the greatest value. Read which one the question asks for.
Key idea
Inequalities give the region. The region gives the corners. The corners give the answer.
Practise inequalities and linear programming now
Interactive visual aids, then real past-paper questions marked on your working like the exam. Free to start.
Practise free on LemmaraReal past-paper questions on inequalities and linear programming
Each with a full worked solution.
Lemmara is an independent study tool, not affiliated with or endorsed by Cambridge International Education or Pearson Edexcel. The lessons and worked examples are Lemmara’s own.