Question 1: Problem solving

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. Write down the number of stages n, the decision variables Xn, the objective function In(s,xn) and its minimum fit (s). 2. Construct the tables for n = 3, n = 2, and n = 1. 3. Based on the tables you constructed write down the fastest route (minimum time) from A to G, and the minimum overall travel time. 4. Represent the optimal solution graphically on the network. i D B 6 5 5 8 LO 4 A E G 6 6 do F