A manufacturing firm located in Chicago ships its product by railroad to Detroit. Several different routes are available, as shown in the following diagram, referred to as a network:

Each circle in the network represents a railroad junction. Each arrow is a railroad branch between two junctions. The number above each arrow is the cost ($1,000s) necessary to ship 1 ton of product from junction to junction. The firm wants to ship 5 tons of its product from Chicago to Detroit at the minimum cost.
a. Formulate a linear programming model for this problem.
b. Solve the model by using thecomputer.

Transcribed Image Text:

3 3 Detroit Chicago 0 4 7 5 8 2