Solving the model, we get the following values for F:

          Variable           Value

             F( 1)        19.00000

             F( 2)        19.00000

             F( 3)        14.00000

             F( 4)        20.00000

             F( 5)        8.000000

             F( 6)        7.000000

             F( 7)        12.00000

             F( 8)        5.000000

             F( 9)        2.000000

            F( 10)        0.000000

Solution: DYNAMB

F(1), the shortest distance from city 1 to city 10, gives us the distance of the shortest path of 19. For the curious reader, this distance corresponds to the path 1→3→5→8→10. Refer to model DYNAMB2.LG4 to see how to extend this model to compute the actual path as well as its distance.