Formulating and graphical solution of LPs

Formulating and graphical solution of LPs Test

Spec DD1–DD2 · AQA 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

AQA A-Level Further Maths

Formulating and graphical solution of LPs

Total 27 marks

Name

Class

Date

  1. 1
    A workshop makes xx tables and yy chairs each week. Each table needs 4 hours of carpentry and 2 hours of finishing. Each chair needs 2 hours of carpentry and 3 hours of finishing. There are 40 hours of carpentry and 30 hours of finishing available each week. The workshop must make at least twice as many chairs as tables. The profit is £50 per table and £30 per chair, and the workshop wants to maximise its weekly profit.
    (a)
    Which inequality models the carpentry limit?
    [1 mark]
    • A2x+4y≤402x+4y\leq40
    • B4x+2y≥404x+2y\geq40
    • C4x+2y≤304x+2y\leq30
    • D4x+2y≤404x+2y\leq40
    Show the mark scheme

    Mark scheme

    Answer: D
    (b)
    Which inequality models the rule on the number of chairs and tables?
    [1 mark]
    • Ax≥2yx\geq2y
    • By≤2xy\leq2x
    • Cy≥2xy\geq2x
    • Dy≥x+2y\geq x+2
    Show the mark scheme

    Mark scheme

    Answer: C
    (c)
    Write down the objective function and explain why x≥0x\geq0 and y≥0y\geq0 must be included as constraints.
    [2 marks]
    Show the mark scheme

    Mark scheme

    B1: maximise P=50x+30yP=50x+30y
    R1: the workshop cannot make a negative number of tables or chairs

    Accept:
    P=50x+30yP=50x+30y with 'maximise' stated in words

    Total for question 1: 4 marks

  2. 2
    A farmer mixes xx kg of feed XX and yy kg of feed YY for each day. Each kilogram of XX has 3 units of protein and 1 unit of fibre and costs £3. Each kilogram of YY has 2 units of protein and 2 units of fibre and costs £4. Each day the mixture must contain at least 24 units of protein and at least 12 units of fibre, and it must weigh at most 10 kg. The farmer wants to minimise the daily cost.
    (a)
    Which inequality models the fibre requirement?
    [1 mark]
    • A2x+y≥122x+y\geq12
    • Bx+2y≥12x+2y\geq12
    • Cx+2y≤12x+2y\leq12
    • D3x+2y≥123x+2y\geq12
    Show the mark scheme

    Mark scheme

    Answer: B
    (b)
    The feasible region is a triangle with vertices (6,3)(6,3), (4,6)(4,6) and (8,2)(8,2). What is the minimum daily cost?
    [1 mark]
    • A£30
    • B£33
    • C£32
    • D£36
    Show the mark scheme

    Mark scheme

    Answer: A
    (c)
    Explain why a mixture of 5 kg of XX and 4 kg of YY is not allowed.
    [2 marks]
    Show the mark scheme

    Mark scheme

    M1: substitutes x=5x=5, y=4y=4 into a constraint, e.g. protein 3(5)+2(4)=233(5)+2(4)=23
    A1:
    23<2423<24, so the protein requirement is not met

    Total for question 2: 4 marks

  3. 3
    Maximise P=3x+2yP=3x+2y subject to 2x+y≤142x+y\leq14, x+2y≤10x+2y\leq10, x≥0x\geq0 and y≥0y\geq0.
    (a)
    Find the coordinates of the vertices of the feasible region.
    [3 marks]
    Show the mark scheme

    Mark scheme

    B1: (0,0)(0,0), (7,0)(7,0) and (0,5)(0,5)
    M1: solves
    2x+y=142x+y=14 and x+2y=10x+2y=10 simultaneously
    A1:
    (6,2)(6,2)
    Accept:
    (7,0)(7,0) and (0,5)(0,5) found from the axis intercepts of 2x+y=142x+y=14 and x+2y=10x+2y=10
    (b)
    Use the objective line method to find the optimal solution and the maximum value of PP.
    [4 marks]
    Show the mark scheme

    Mark scheme

    B1: objective line 3x+2y=k3x+2y=k has gradient −32-\frac32
    M1: moves the line parallel to itself away from the origin to the last vertex of the feasible region it touches

    A1: optimal vertex
    (6,2)(6,2)
    A1:
    P=3(6)+2(2)=22P=3(6)+2(2)=22
    Accept: evaluating
    PP at each vertex, 00, 2121, 2222, 1010, and choosing the greatest

    Total for question 3: 7 marks

  4. 4
    A school shop makes xx sandwiches and yy wraps each morning. A sandwich takes 3 minutes to prepare and a wrap takes 2 minutes, and there are 120 minutes of preparation time. At most 50 items can be made altogether, and at least 15 wraps must be made for the staff. The profit is £4 per sandwich and £3 per wrap.
    (a)
    Formulate this as a linear programming problem and use a graphical method to find the maximum profit.
    [6 marks]
    Show the mark scheme

    Mark scheme

    B1: maximise P=4x+3yP=4x+3y
    B1:
    3x+2y≤1203x+2y\leq120
    B1:
    x+y≤50x+y\leq50
    B1:
    y≥15y\geq15 and x≥0x\geq0
    M1: finds the vertices of the feasible region, or draws an objective line of gradient
    −43-\frac43 and moves it away from the origin
    A1:
    x=20x=20, y=30y=30 and a maximum profit of £170
    Accept:
    x≥0x\geq0 omitted
    (b)
    The manager decides that at least as many sandwiches as wraps must be made. Show that the optimal plan in (a) changes, and find the new optimal plan and profit.
    [6 marks]
    Show the mark scheme

    Mark scheme

    M1: adds x≥yx\geq y
    M1:
    (20,30)(20,30) breaks x≥yx\geq y, so it is no longer feasible
    A1: new vertex
    (24,24)(24,24) from 3x+2y=1203x+2y=120 and x=yx=y
    A1: other vertices
    (15,15)(15,15) and (30,15)(30,15)
    M1: evaluates
    PP at the vertices, 105105, 165165, 168168
    A1: 24 sandwiches and 24 wraps, with a maximum profit of £168

    Total for question 4: 12 marks

End of questions

Subtopic tests