Graphical solution of linear programs

Graphical solution of linear programs Test

Spec 5.2 · Edexcel A-Level Further 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 A-Level Further Maths

Graphical solution of linear programs

Total 27 marks

Name

Class

Date

  1. 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.
    (a)
    Find the coordinates of the point where the lines 2x+y=122x+y=12 and x+2y=10x+2y=10 meet.
    [1 mark]
    • A(4,4)(4,4)
    • B(143,83)\left(\frac{14}{3},\frac{8}{3}\right)
    • C(5,2)(5,2)
    • D(6,0)(6,0)
    Show the mark scheme

    Mark scheme

    Answer: B
    (b)
    What is the gradient of the objective line 5x+4y=k5x+4y=k?
    [1 mark]
    • A54\frac54
    • B−45-\frac45
    • C45\frac45
    • D−54-\frac54
    Show the mark scheme

    Mark scheme

    Answer: D
    (c)
    Find the maximum profit.
    [2 marks]
    Show the mark scheme

    Mark scheme

    M1: evaluates PP at the vertices (or slides the objective line to the last vertex), including (143,83)\left(\frac{14}{3},\frac{8}{3}\right)
    A1: £34, at
    (143,83)\left(\frac{14}{3},\frac{8}{3}\right)
    Accept: 34 without units

    Total for question 1: 4 marks

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

    Mark scheme

    Answer: A
    (b)
    What is the minimum weekly cost, to the nearest penny?
    [1 mark]
    • A£32.00
    • B£45.00
    • C£28.67
    • D£29.00
    Show the mark scheme

    Mark scheme

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

    Mark scheme

    M1: cost must be a whole number of pounds and at least 863=28.67\frac{86}{3}=28.67, so at least £29 (or tests integer points near (103,143)\left(\frac{10}{3},\frac{14}{3}\right))
    A1:
    x=3x=3, y=5y=5 (feasible: 8≥88\ge8, 31≥3031\ge30), cost £29

    Total for question 2: 4 marks

  3. 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.
    (a)
    Use the vertex method to find the maximum profit if shelves and stools did not need to be whole numbers.
    [3 marks]
    Show the mark scheme

    Mark scheme

    M1: solves 4x+3y=264x+3y=26 and x+2y=10x+2y=10 to find a vertex, and finds the other vertices (6.5,0)(6.5,0) and (0,5)(0,5)
    A1:
    (4.4,2.8)(4.4,2.8) with P=18.8P=18.8, P=19.5P=19.5 at (6.5,0)(6.5,0) and P=10P=10 at (0,5)(0,5)
    A1: maximum
    P=19.5P=19.5 at (6.5,0)(6.5,0)
    Accept:
    P=0P=0 at the origin
    (b)
    The joiner can only make whole numbers of shelves and stools. Find the optimal whole-number plan, explaining why simply rounding (6.5,0)(6.5,0) does not work.
    [4 marks]
    Show the mark scheme

    Mark scheme

    B1: (7,0)(7,0) is infeasible because 4(7)=28>264(7)=28>26
    M1: tests whole-number points close to the optimum, e.g.
    (6,0)(6,0) gives P=18P=18 and (5,2)(5,2) is feasible
    A1:
    (5,2)(5,2) is feasible (26≤2626\le26, 9≤109\le10) with P=19P=19
    R1:
    PP is a whole number and at most 19.5 for any feasible point, so 19 is the maximum
    Accept:
    (6,1)(6,1) rejected as 27>2627>26

    Total for question 3: 7 marks

  4. 4
    A charity hires xx coaches and yy minibuses for a trip. A coach holds 50 people and a minibus holds 20, and at least 240 people must be taken. No more than 10 vehicles are available. A coach costs £300 and a minibus costs £100 to hire. The charity wishes to minimise the total hire cost CC (in pounds).
    (a)
    (i) Write down the two constraints (other than non-negativity), simplifying the capacity constraint so that it has no common factor.
    (ii) Find the coordinates of the vertices of the feasible region.
    [6 marks]
    Show the mark scheme

    Mark scheme

    B1: (i) 50x+20y≥24050x+20y\ge240, simplified to 5x+2y≥245x+2y\ge24
    B1: (i)
    x+y≤10x+y\le10
    B1: (ii)
    (4.8,0)(4.8,0)
    B1: (ii)
    (10,0)(10,0)
    M1: (ii) solves
    5x+2y=245x+2y=24 and x+y=10x+y=10 simultaneously
    A1: (ii)
    (43,263)\left(\frac43,\frac{26}{3}\right)
    Accept:
    (1.33,8.67)(1.33,8.67)
    (b)
    (i) Use the vertex method to find the minimum cost if xx and yy need not be whole numbers.
    (ii) The charity can only hire whole vehicles. Find the optimal whole-number hire and its cost, showing that the vertex rounded to
    (1,9)(1,9) is not suitable.
    [6 marks]
    Show the mark scheme

    Mark scheme

    M1: (i) evaluates C=300x+100yC=300x+100y at the vertices
    A1: (i) £1440 at
    (4.8,0)(4.8,0), £3000 at (10,0)(10,0) and £1266.67 at (43,263)\left(\frac43,\frac{26}{3}\right)
    A1: (i) minimum £1267 (£1266.67) at
    (43,263)\left(\frac43,\frac{26}{3}\right)
    B1: (ii)
    (1,9)(1,9) is infeasible because 5+18=23<245+18=23<24
    M1: (ii) cost is a multiple of £100 and at least £1266.67, so at least £1300

    A1: (ii)
    (2,7)(2,7) is feasible (50(2)+20(7)=24050(2)+20(7)=240, 9 vehicles) with cost £1300, which is therefore optimal
    Accept: £1270 for (i)

    Total for question 4: 12 marks

End of questions

Subtopic tests