All mind maps topics

Graphical solution of linear programsEdexcel International A Level Maths: Mind map

Feasible region
Vertex method
Ruler method

Graphical LP

region, vertices, ruler

regionvertexruler
Minimisation
Integer solutions
Exam tips

Exam questions on Graphical solution of linear programs

  1. A furniture company makes xx desks and yy chairs each day. The company wants to maximise its daily profit P=5x+4yP=5x+4y (in hundreds of pounds), subject to the constraints x+y≤10x+y\le10 (worker hours), 3x+y≤183x+y\le18 (workshop space), x≥0x\ge0 and y≥0y\ge0.
    The feasible region has vertices (0,0)(0,0), (6,0)(6,0), (4,6)(4,6) and (0,10)(0,10). Use the vertex method to find the maximum value of PP and the values of xx and yy at which it occurs.2 marks
  2. A school canteen mixes xx kg of ingredient X and yy kg of ingredient Y in each batch. The cost is C=4x+3yC=4x+3y pence, which is to be minimised, subject to 2x+y≥122x+y\ge12 (energy), x+2y≥9x+2y\ge9 (protein), x+y≤10x+y\le10 (tank capacity), x≥0x\ge0 and y≥0y\ge0.
    Show that the lines 2x+y=122x+y=12 and x+2y=9x+2y=9 meet at (5,2)(5,2), and find the value of CC there.2 marks
  3. A potter makes xx mugs and yy bowls each day. The clay available gives 2x+3y≤142x+3y\le14 and the kiln time available gives 4x+y≤154x+y\le15, with x≥0x\ge0 and y≥0y\ge0. The profit is P=5x+4yP=5x+4y pounds, which is to be maximised.
    Show that the lines 2x+3y=142x+3y=14 and 4x+y=154x+y=15 meet at (3.1, 2.6)(3.1,\,2.6), and find the value of PP there.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).