Step 6 of 8 · Worked example · TEACH
0 of 3 done
Work through the example to CHECK to open the problems.
Reach CHECK to open the problems.Higher Level · Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 6Follow the worked example and explain why each modelling and calculation step is valid.
Travel from A to terminal D is permitted only along A→B (4), A→C (9), B→D (5), C→D (11). All weights are costs. Find the minimum cost from A using backward values.
Travel from A to the terminal D is allowed only along A→B (4), A→C (9), B→D (5) and C→D (11). All weights are costs.
Find the minimum cost from A using backward values.
Higher Level Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 6 of 8
Bellman’s principle finds an optimal policy by combining each immediate cost with the best remaining cost from the next state.
In exam network problems, backward dynamic programming gives a justified minimum rather than an unsupported cheapest-edge guess.
Travel from A to the terminal D is allowed only along A→B (4), A→C (9), B→D (5) and C→D (11). All weights are costs. Find the minimum cost from A using backward values.