plumiGraphical solution: OCR MEI A‑Level Further Maths questions
OCR MEI A-Level Further Maths past-paper questions on 4.2 Graphical solution, 2018–2025, with mark schemes and examiner’s reports where available. Add MadAsMaths questions to your practice, or browse them separately by topic and difficulty.
Questions from
Paper
All papers
Exam
All years
Loading the question…
Open the full PDFLoading the question…
Open the full PDFLoading the question…
Open the full PDFLoading the question…
Open the full PDFLoading the question…
Open the full PDFLoading the question…
Open the full PDFLoading the question…
Open the full PDF
All 7 questions on Graphical solution, as a list
- June 2025, Modelling with Algorithms, Q6 (14 marks): An incomplete initial tableau for a two-stage simplex solution for a maximisation linear programming problem, in x, y and z where , x y z , 0 , is shown below.
- June 2025, AS Modelling with Algorithms, Q7 (12 marks): The diagram shows an activity network for a project. Each activity is represented by an arc. The expressions in brackets show the duration of these activities i
- June 2023, AS Modelling with Algorithms, Q6 (13 marks): Fig. 6.1 y 2 y 5 x = 13 12 11 3 y 2 x = 10 9 8 7 6 5 4 3 R 2 1 x 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 x y x y 3 2 20 2 12 + = + = Fig. 6.1 shows the constraint
- June 2022, Modelling with Algorithms, Q7 (15 marks): Kai makes three sizes of model car, small, medium and large, to sell each year at a fair. Kai has enough material to make either 250 small cars or 175 medium ca
- November 2021, AS Modelling with Algorithms, Q6 (14 marks): An incomplete initial tableau for a two-stage simplex solution for a maximisation integer linear programming (ILP) problem, in x, y and z where , , x y z 0 , is
- November 2020, Modelling with Algorithms, Q5 (19 marks): y k (1,k) (3,2) R 1 0.5 x 0.75 1 5 Fig. 5.1 Fig. 5.1 shows the constraints of a linear programming problem, in which the objective is to maximise a function of
- June 2019, AS Modelling with Algorithms, Q5 (17 marks): An LP problem in x, y and z is formulated as follows. Maximise P 3 x 2 y 5 z = + + subject to x y z 26 + + H 2 x y z 34 + + G 2 x z 10 - = x y z , , 0 H (a) • C
Questions, mark schemes and examiner’s reports are © OCR, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? OCR MEI A-Level Further Maths past papers.
The Plumi iPad app also offers exam-style questions with AI feedback on your handwritten working.