Edexcel A-Level Further Maths
Graphical solution of linear programs
Total 27 marks
Name
Class
Date
- 1A cleaning company makes litres of cleaner A and litres of cleaner B each hour. The constraints are and , with and . The profit in pounds is . The quantities do not need to be whole numbers.(a)Find the coordinates of the point where the lines and meet.[1 mark]
- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: B(b)What is the gradient of the objective line ?[1 mark]- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: D(c)Find the maximum profit.[2 marks]Show the mark scheme
Mark scheme
M1: evaluates at the vertices (or slides the objective line to the last vertex), including
A1: £34, at
Accept: 34 without unitsTotal for question 1: 4 marks
- 2A zoo buys kg of feed X and kg of feed Y each week. The requirements are (total mass) and (protein units), with and . The weekly cost in pounds is , 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
- B
- C
- D
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 , so at least £29 (or tests integer points near )
A1: , (feasible: , ), cost £29Total for question 2: 4 marks
- 3A joiner makes shelves and stools each week. The wood constraint is and the time constraint is , with and . Each shelf gives £3 profit and each stool gives £2 profit, so the weekly profit is 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 and to find a vertex, and finds the other vertices and
A1: with , at and at
A1: maximum at
Accept: 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 does not work.[4 marks]Show the mark scheme
Mark scheme
B1: is infeasible because
M1: tests whole-number points close to the optimum, e.g. gives and is feasible
A1: is feasible (, ) with
R1: is a whole number and at most 19.5 for any feasible point, so 19 is the maximum
Accept: rejected asTotal for question 3: 7 marks
- 4A charity hires coaches and 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 (in pounds).(a)(i) Write down the two constraints (other than non-negativity), simplifying the capacity constraint so that it has no common factor.[6 marks]
(ii) Find the coordinates of the vertices of the feasible region.Show the mark scheme
Mark scheme
B1: (i) , simplified to
B1: (i)
B1: (ii)
B1: (ii)
M1: (ii) solves and simultaneously
A1: (ii)
Accept:(b)(i) Use the vertex method to find the minimum cost if and need not be whole numbers.[6 marks]
(ii) The charity can only hire whole vehicles. Find the optimal whole-number hire and its cost, showing that the vertex rounded to is not suitable.Show the mark scheme
Mark scheme
M1: (i) evaluates at the vertices
A1: (i) £1440 at , £3000 at and £1266.67 at
A1: (i) minimum £1267 (£1266.67) at
B1: (ii) is infeasible because
M1: (ii) cost is a multiple of £100 and at least £1266.67, so at least £1300
A1: (ii) is feasible (, 9 vehicles) with cost £1300, which is therefore optimal
Accept: £1270 for (i)Total for question 4: 12 marks
End of questions