All mind maps topics

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

  1. A cleaning company makes xx litres of cleaner A and yy litres of cleaner B each hour. The constraints are 2x+y≤122x+y\le12 and x+2y≤10x+2y\le10, with x≥0x\ge0 and y≥0y\ge0. The profit in pounds is P=5x+4yP=5x+4y. The quantities do not need to be whole numbers.
    Find the maximum profit.2 marks
  2. A zoo buys xx kg of feed X and yy kg of feed Y each week. The requirements are x+y≥8x+y\ge8 (total mass) and 2x+5y≥302x+5y\ge30 (protein units), with x≥0x\ge0 and y≥0y\ge0. The weekly cost in pounds is C=3x+4yC=3x+4y, 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
  3. A joiner makes xx shelves and yy stools each week. The wood constraint is 4x+3y≤264x+3y\le26 and the time constraint is x+2y≤10x+2y\le10, with x≥0x\ge0 and y≥0y\ge0. Each shelf gives £3 profit and each stool gives £2 profit, so the weekly profit is P=3x+2yP=3x+2y pounds.
    Use the vertex method to find the maximum profit if shelves and stools did not need to be whole numbers.3 marks
See the full worksheet

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).