Edexcel International A Level Maths
Graphical solution of linear programs
Total 27 marks
Name
Class
Date
- 1A furniture company makes desks and chairs each day. The company wants to maximise its daily profit (in hundreds of pounds), subject to the constraints (worker hours), (workshop space), and .(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: 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 , , and . Use the vertex method to find the maximum value of and the values of and at which it occurs.[2 marks]Show the mark scheme
Mark scheme
M1: evaluates at all vertices: , , ,
A1: maximum (£4400) at ,
Accept: 44 without unitsTotal for question 1: 4 marks
- 2A school canteen mixes kg of ingredient X and kg of ingredient Y in each batch. The cost is pence, which is to be minimised, subject to (energy), (protein), (tank capacity), and .(a)Which of these points lies in the feasible region?[1 mark]
- A
- B
- C
- D
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 and meet at , and find the value of there.[2 marks]Show the mark scheme
Mark scheme
M1: solves and , e.g. , or substitutes in both: and
A1: pence
AGTotal for question 2: 4 marks
- 3A potter makes mugs and bowls each day. The clay available gives and the kiln time available gives , with and . The profit is pounds, which is to be maximised.(a)Show that the lines and meet at , and find the value of there.[3 marks]
Show the mark scheme
Mark scheme
M1: eliminates a variable, e.g. into to give
A1: ,
B1:(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 : , so it is infeasible
A1: is feasible: and , giving
B1: considers other points: gives , gives , and is impossible since
B1: 3 mugs and 2 bowls, profit £23Total for question 3: 7 marks
- 4A garden centre prepares trays of herbs and trays of flowers each day. Labour limits production to , greenhouse space gives , and seed supply gives , with and . The profit is pounds, which is to be maximised.(a)Find the coordinates of the vertices of the feasible region, and hence find the maximum value of if and can take any non-negative values.[6 marks]
Show the mark scheme
Mark scheme
B1: vertices on the axes: and (and )
M1: solves and
A1:
B1: , where meets
M1: evaluates at all vertices, , , , ,
A1: maximum at ,
Accept: use of the ruler method with the objective line leading to the same vertex(b)Trays cannot be split, so and must be integers. Explain why 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: is infeasible:
B1: the maximum of over the whole region is , at the non-integer vertex , so every integer point has
M1: tests a nearby point such as : and
A1: is feasible with
M1: the line touches the region only at that non-integer vertex, so no integer point gives ; so is the best
A1: 4 trays of herbs and 7 trays of flowers, profit £59
Accept: any valid argument that no integer point givesTotal for question 4: 12 marks
End of questions