Share
Explore BrainMass

Path- Distance (Shortest Route)

Consider the following shortest-route problem involving seven cities. The distances between the cities are given below. Draw the network model for this problem and formulate the LP for finding the shortest route from City 1 to City 7

Path Distance
1 to 2 6
1 to 3 10
1 to 4 7
2 to 3 4
2 to 5 5
3 to 4 5
3 to 5 2
3 to 6 4
4 to 6 8
5 to 7 7
6 to 7 5

Solution Summary

Path- Distance (Shortest Route)

$2.19