AQA A-Level Further Maths
Formulating and graphical solution of LPs
Total 27 marks
Name
Class
Date
- 1A workshop makes tables and 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]
- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: D(b)Which inequality models the rule on the number of chairs and tables?[1 mark]- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: C(c)Write down the objective function and explain why and must be included as constraints.[2 marks]Show the mark scheme
Mark scheme
B1: maximise
R1: the workshop cannot make a negative number of tables or chairs
Accept: with 'maximise' stated in wordsTotal for question 1: 4 marks
- 2A farmer mixes kg of feed and kg of feed for each day. Each kilogram of has 3 units of protein and 1 unit of fibre and costs £3. Each kilogram of 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]
- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: B(b)The feasible region is a triangle with vertices , and . 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 and 4 kg of is not allowed.[2 marks]Show the mark scheme
Mark scheme
M1: substitutes , into a constraint, e.g. protein
A1: , so the protein requirement is not metTotal for question 2: 4 marks
- 3Maximise subject to , , and .(a)Find the coordinates of the vertices of the feasible region.[3 marks]
Show the mark scheme
Mark scheme
B1: , and
M1: solves and simultaneously
A1:
Accept: and found from the axis intercepts of and(b)Use the objective line method to find the optimal solution and the maximum value of .[4 marks]Show the mark scheme
Mark scheme
B1: objective line has gradient
M1: moves the line parallel to itself away from the origin to the last vertex of the feasible region it touches
A1: optimal vertex
A1:
Accept: evaluating at each vertex, , , , , and choosing the greatestTotal for question 3: 7 marks
- 4A school shop makes sandwiches and 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
B1:
B1:
B1: and
M1: finds the vertices of the feasible region, or draws an objective line of gradient and moves it away from the origin
A1: , and a maximum profit of £170
Accept: 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
M1: breaks , so it is no longer feasible
A1: new vertex from and
A1: other vertices and
M1: evaluates at the vertices, , ,
A1: 24 sandwiches and 24 wraps, with a maximum profit of £168Total for question 4: 12 marks
End of questions