Graphical solution of linear programsEdexcel International A Level Maths: Subtopic test
10 questions, 27 marks
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
(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
(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]Total 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
(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
(c)Show that the lines and meet at , and find the value of there.[2 marks]Total 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](b)The potter can only make whole mugs and bowls. Find the best production plan and the maximum profit.[4 marks]
Total 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](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]
Total for question 4: 12 marks
End of questions
Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).