Pearson Edexcel A Level Further Mathematics Paper 4d 2025 Qp

Get the official Pearson Edexcel A-Level Further Mathematics Paper 4D: Decision Mathematics 2 question paper from the Summer 2025 examination series (9FM0/4D). This examiner-issued PDF contains the complete original June 2025 exam paper covering decision trees, expected monetary value, Hungarian algorithm allocations, transportation problems, stepping-stone method, network flows, dynamic programming, game theory, Simplex algorithm applications and recurrence relations.

This paper assesses advanced Decision Mathematics 2 modelling techniques including capacitated network flows, minimum-cost transportation, linear programming formulation, optimisation algorithms, mixed-strategy games, recurrence-relation modelling and dynamic programming production scheduling. Pair it with the matching Edexcel 9FM0/4D June 2025 mark scheme on markscheme.net for complete examiner-standard revision and self-assessment. Updated for the 2025/2026 academic year, optimised for mobile and desktop, and instantly downloadable from markscheme.net — your fastest route to top-grade Further Mathematics revision.

This document is designed for Year 13 students preparing for the 2026 Pearson Edexcel A-Level Further Mathematics examinations, including retake candidates targeting A/A* grades, private candidates, international learners and home-schooled students specialising in Decision Mathematics. It is especially valuable for students applying for operations research, computer science, economics, actuarial science, data science and mathematics degree programmes where optimisation and algorithmic reasoning are heavily examined.

Teachers, tutors, sixth-form colleges and revision providers can use this paper for timed mock examinations, algorithm-modelling workshops, network-flow demonstrations and advanced optimisation problem-solving sessions. It is also ideal for identifying weaknesses in dynamic programming, transportation algorithms and game theory before the 2026 examination series.