Chapter 12: Decision Mathematics 2: Dynamic Programming

A-level Further MathsDecision Mathematics 1 & 23 topicsHigher

StudyStudy Material QuizQuiz ResourcesResources

Mock Papers

Exam-board mock papers

Mock papers launch from 1 August 2026. New papers will be added regularly from this date.

Dashboard tracking

Included with paid subject access

You can see the paper details now. Access unlocks when your plan includes this subject and tier.

Mock paperFeatured

Mock papers launch collection

alevel · further-maths · Decision Mathematics 1 & 2 · All papers

Releases 1 August 2026

Locked

Topic-aware long answers

Ultimate/Lifetime long-answer set

Ultimate and Lifetime users can create one saved set of 4 extended-response questions for this topic and mark answers with examiner-style feedback.

AI MCQ generation is available to paying students: 20 questions per session,2 sessions per month. Long-answer AI generation requires Ultimate or Lifetime access.

Free starter set

Decision Mathematics 2: Dynamic Programming: Edexcel Further Maths Optional Long-Answer Questions

Examiner-style long-answer practice with automatic marking, improvement advice and ProofCoach tracking.

4 questions32 marks64 min

standard / hard / synoptic

8 marksfindstandardEdexcel

D12-1 Find the required result for Decision Mathematics 2: Dynamic Programming. Given A route has stages 1 to 4 with costs: A to B 5, A to C 2; B to D 4, B to E 7; C to D 6, C to E 3; D to T 5, E to T 4. Use construct stage-state tables and use backward induction. (8 marks)

Define the variables, diagram labels, distribution parameters or algorithm table columns needed.
Substitute the concrete values from the question before simplifying.
Show the intermediate line that earns the main method mark.
Complete the calculation, table trace or proof and state the final result.

0 characters

Write your answer first, then mark it.

8 marksshow thathardEdexcel

D12-2 Show that the minimum from E to T is 4 for Decision Mathematics 2: Dynamic Programming. Start from A route has stages 1 to 4 with costs: A to B 5, A to C 2; B to D 4, B to E 7; C to D 6, C to E 3; D to T 5, E to T 4. (8 marks)

Define the variables, diagram labels, distribution parameters or algorithm table columns needed.
Substitute the concrete values from the question before simplifying.
Show the intermediate line that earns the main method mark.
Complete the calculation, table trace or proof and state the final result.

0 characters

Write your answer first, then mark it.

8 marksdeterminehardEdexcel

D12-3 Determine the requested value in this structured Decision Mathematics 2: Dynamic Programming problem: find the shortest route from A to T. Use the same data: A route has stages 1 to 4 with costs: A to B 5, A to C 2; B to D 4, B to E 7; C to D 6, C to E 3; D to T 5, E to T 4. (8 marks)

Define the variables, diagram labels, distribution parameters or algorithm table columns needed.
Substitute the concrete values from the question before simplifying.
Show the intermediate line that earns the main method mark.
Complete the calculation, table trace or proof and state the final result.

0 characters

Write your answer first, then mark it.

8 markshencesynopticEdexcel

D12-4 Hence use the result the minimum from E to T is 4 to complete the extension for Decision Mathematics 2: Dynamic Programming: find the shortest route from A to T. (8 marks)

Define the variables, diagram labels, distribution parameters or algorithm table columns needed.
Substitute the concrete values from the question before simplifying.
Show the intermediate line that earns the main method mark.
Complete the calculation, table trace or proof and state the final result.

0 characters

Write your answer first, then mark it.

Subject MCQ Bank

20 stored MCQs for this topic

Paying students get 20 stored MCQs per generation session and 2sessions each month. Your set is saved here so you can reset and retake it without using another allowance. If the bank is running low, replenishment happens in the background.

The 20-question stored MCQ bank is premium-only. Free users can study the starter unit and standard quiz, but bank practice unlocks after purchasing the subject.

Loading practice tools...

← Previous

11. Decision Mathematics 2: Flows in Networks

13. Decision Mathematics 2: Game Theory

Key learning objectives

Understand the key principles behind Decision Mathematics 2: Dynamic Programming.
Apply these ideas to exam-style questions.
Recall the essential definitions and key terms.