Old MathJax webview

this is the only data

Dynamic Programming Consider the following network where the numbers above the arcs are times. We want to determine the fastest route from A to G. Apply the dynamic programming approach to solve this problem (optimal route), by performing the following steps: (1 Mark) (6 Marks) 3. Based on the tables you constructed write down the fastest route (minimum time) from A to G, and the minimum overall travel time. (2 Marks) 4. Represent the optimal solution graphically on the network. (1 Mark) D = 6 B 5 8 5 2 A E G 9 8 5