D2 June 2010 Q4

EdexcelOld spec13 marksDynamic Programming

4.

Figure 1: directed network from S to T. S to A 37, S to B 39, S to C 41; A to D 41, A to E 38, B to E 44, C to E 36, C to F 35; D to G 22, D to H 31, E to H 34, E to I 39, F to I 52; G to T 17, H to T 21, I to T 29
Figure 1

Figure 1 represents the maintenance choices a council can make and their costs, in £1000s, over the next four years.

The council wishes to minimise the greatest annual cost of maintenance.

(a) Use dynamic programming to find a minimax route from S to T. (9)
(b) State your route and the greatest annual cost incurred by the council. (2)
(c) Calculate the average annual cost to the council. (2)