Graphical solution of linear programsEdexcel A-Level Further Maths: Mind map
Feasible region
Objective line
Vertex method
Graphical LPs
two variables
regionobjective linevertex
Integer solutions
Minimising
Exam tips
Exam questions on Graphical solution of linear programs
- A cleaning company makes litres of cleaner A and litres of cleaner B each hour. The constraints are and , with and . The profit in pounds is . The quantities do not need to be whole numbers.Find the maximum profit.2 marks
- A zoo buys kg of feed X and kg of feed Y each week. The requirements are (total mass) and (protein units), with and . The weekly cost in pounds is , which the zoo wishes to minimise. Unless stated otherwise, feed can be bought in any quantity.The zoo can now only buy whole numbers of kilograms of each feed. Find the minimum cost and the quantities that give it.2 marks
- A joiner makes shelves and stools each week. The wood constraint is and the time constraint is , with and . Each shelf gives £3 profit and each stool gives £2 profit, so the weekly profit is pounds.Use the vertex method to find the maximum profit if shelves and stools did not need to be whole numbers.3 marks
Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).