Network optimization question

In the network shown below, the numbers on the arcs represent arc lengths. Formulate the methodology by which you would find the three shortest chains from node #1 to node #5, using the most efficient procedure you know. Describe how you would set up this problem with all necessary parameters and matrices and carry out one complete double sweep iteration of the methodology. Do not try to finish all the iterations to optimality.

3

5

image1.png