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.Ordinary 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 (8), A→C (13), B→D (9), C→D (15). 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 (8), A→C (13), B→D (9) and C→D (15). All weights are costs.
Find the minimum cost from A using backward values.
Ordinary Level Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 6 of 8
Bellman's principle finds the best route by combining each next-edge cost with the best remaining cost from its destination.
Working backwards stores useful results at each state and avoids judging a whole journey by its first edge alone.
Travel from A to the terminal D is allowed only along A→B (8), A→C (13), B→D (9) and C→D (15). All weights are costs. Find the minimum cost from A using backward values.