Graphical solution of linear programs

Graphical solution of linear programs Test

Spec 5.2 · Edexcel International A Level Maths: Subtopic test

Studying this course? Keep your progress in one place.

Two ways to do this test

Question by question

One question at a time. Each answer is marked the moment you hand it in, so you learn as you go. Drago helps if you get stuck. All 10 questions, or just 5.

Exam mode

The whole paper in one go, timed like the real exam. Nothing is marked until you hand it in, then you get every mark explained.

10 questions, 27 marks

Edexcel International A Level Maths

Graphical solution of linear programs

Total 27 marks

Name

Class

Date

  1. 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.
    (a)
    Find the coordinates of the point where the lines x+y=10x+y=10 and 3x+y=183x+y=18 meet.
    [1 mark]
    • A(6,4)(6,4)
    • B(5,5)(5,5)
    • C(3,7)(3,7)
    • D(4,6)(4,6)
    Show the mark scheme

    Mark scheme

    Answer: D
    (b)
    Which describes the ruler method for finding the optimal point?
    [1 mark]
    • ASlide a ruler parallel to the objective line away from the origin; the optimum is the last point of the feasible region it touches
    • BSlide a ruler parallel to the objective line towards the origin; the optimum is the first point of the region it touches
    • CSlide a ruler perpendicular to the objective line to the nearest vertex
    • DSlide a ruler parallel to the objective line away from the origin; the optimum is the first point of the region it touches
    Show the mark scheme

    Mark scheme

    Answer: A
    (c)
    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]
    Show the mark scheme

    Mark scheme

    M1: evaluates PP at all vertices: 00, 3030, 4444, 4040
    A1: maximum
    P=44P=44 (£4400) at x=4x=4, y=6y=6
    Accept: 44 without units

    Total for question 1: 4 marks

  2. 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.
    (a)
    Which of these points lies in the feasible region?
    [1 mark]
    • A(3,3)(3,3)
    • B(1,9)(1,9)
    • C(4,4)(4,4)
    • D(6,6)(6,6)
    Show the mark scheme

    Mark scheme

    Answer: C
    (b)
    Which describes the ruler method for this minimisation problem?
    [1 mark]
    • ASlide a ruler parallel to the objective line away from the origin; the optimum is the last point of the region it touches
    • BSlide a ruler parallel to the objective line away from the origin; the optimum is the first point of the region it touches
    • CSlide a ruler perpendicular to the objective line to the nearest vertex
    • DSlide a ruler parallel to the objective line towards the origin from the far side; the optimum is the first vertex it touches
    Show the mark scheme

    Mark scheme

    Answer: B
    (c)
    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]
    Show the mark scheme

    Mark scheme

    M1: solves 2x+y=122x+y=12 and x+2y=9x+2y=9, e.g. 3x=153x=15, or substitutes (5,2)(5,2) in both: 10+2=1210+2=12 and 5+4=95+4=9
    A1:
    C=4(5)+3(2)=26C=4(5)+3(2)=26 pence
    AG

    Total for question 2: 4 marks

  3. 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.
    (a)
    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]
    Show the mark scheme

    Mark scheme

    M1: eliminates a variable, e.g. y=15−4xy=15-4x into 2x+3y=142x+3y=14 to give −10x=−31-10x=-31
    A1:
    x=3.1x=3.1, y=2.6y=2.6
    B1:
    P=5(3.1)+4(2.6)=25.9P=5(3.1)+4(2.6)=25.9
    (b)
    The potter can only make whole mugs and bowls. Find the best production plan and the maximum profit.
    [4 marks]
    Show the mark scheme

    Mark scheme

    M1: tests a rounded-up point such as (3,3)(3,3): 2(3)+3(3)=15>142(3)+3(3)=15>14, so it is infeasible
    A1:
    (3,2)(3,2) is feasible: 2(3)+3(2)=12≤142(3)+3(2)=12\le14 and 4(3)+2=14≤154(3)+2=14\le15, giving P=23P=23
    B1: considers other points:
    (2,3)(2,3) gives 2222, (1,4)(1,4) gives 2121, and x≥4x\ge4 is impossible since 4x≤154x\le15
    B1: 3 mugs and 2 bowls, profit £23

    Total for question 3: 7 marks

  4. 4
    A garden centre prepares xx trays of herbs and yy trays of flowers each day. Labour limits production to 2x+3y≤302x+3y\le30, greenhouse space gives 4x+2y≤304x+2y\le30, and seed supply gives x≤6x\le6, with x≥0x\ge0 and y≥0y\ge0. The profit is P=6x+5yP=6x+5y pounds, which is to be maximised.
    (a)
    Find the coordinates of the vertices of the feasible region, and hence find the maximum value of PP if xx and yy can take any non-negative values.
    [6 marks]
    Show the mark scheme

    Mark scheme

    B1: vertices on the axes: (0,10)(0,10) and (6,0)(6,0) (and (0,0)(0,0))
    M1: solves
    2x+3y=302x+3y=30 and 4x+2y=304x+2y=30
    A1:
    (3.75, 7.5)(3.75,\,7.5)
    B1:
    (6,3)(6,3), where x=6x=6 meets 4x+2y=304x+2y=30
    M1: evaluates
    PP at all vertices, 00, 5050, 6060, 5151, 3636
    A1: maximum
    P=60P=60 at x=3.75x=3.75, y=7.5y=7.5
    Accept: use of the ruler method with the objective line
    6x+5y=306x+5y=30 leading to the same vertex
    (b)
    Trays cannot be split, so xx and yy must be integers. Explain why (4,8)(4,8) is not a solution, and find the optimal integer solution, explaining why no integer point does better.
    [6 marks]
    Show the mark scheme

    Mark scheme

    B1: (4,8)(4,8) is infeasible: 2(4)+3(8)=32>302(4)+3(8)=32>30
    B1: the maximum of
    PP over the whole region is 6060, at the non-integer vertex (3.75, 7.5)(3.75,\,7.5), so every integer point has P≤60P\le60
    M1: tests a nearby point such as
    (4,7)(4,7): 2(4)+3(7)=29≤302(4)+3(7)=29\le30 and 4(4)+2(7)=30≤304(4)+2(7)=30\le30
    A1:
    (4,7)(4,7) is feasible with P=24+35=59P=24+35=59
    M1: the line
    6x+5y=606x+5y=60 touches the region only at that non-integer vertex, so no integer point gives 6060; so 5959 is the best
    A1: 4 trays of herbs and 7 trays of flowers, profit £59

    Accept: any valid argument that no integer point gives
    P>59P>59

    Total for question 4: 12 marks

End of questions

Subtopic tests