1 A truck must travel from New York to Los Angeles. As shown in Figure 68, a variety of routes are available. The number associated with each arc is the number of gallons of fuel required by the truck to traverse the arc.

a Use Dijkstra’s algorithm to find the route from New York to Los Angeles that uses the minimum amount of gas.

b Formulate a balanced transportation problem that could be used to find the route from New York to Los Angeles that uses the minimum amount of gas.

c Formulate as an MCNFP the problem of finding the New York to Los Angeles route that uses the minimum amount of gas.

Transcribed Image Text:

1800 Cleveland Phoenix 900 400 400 1100 900 950 600 1300 Los New York St. Louis Dallas Angeles 800 600 1000 600 1200 Salt Nashville Lake City,