Step 7 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 7Follow the worked example and explain why each modelling and calculation step is valid.
Connect all sites with minimum total cable length, without requiring a route from one source. Select a suitable algorithm and justify the choice.
Connect all the sites with the least total cable length. No route from one particular source is needed.
Select a suitable algorithm and justify the choice.
Ordinary Level Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 7 of 8
Choose an algorithm by deciding whether the aim is a cheapest connected network or a shortest route.
Minimising total cable length does not necessarily give the cheapest travel route between towns.
Connect all the sites with the least total cable length. No route from one particular source is needed. Select a suitable algorithm and justify the choice.