(16 points total)

5. Shown below is the data for a Transportation Problem with 3 origins (STL, KC, and CH) and 4 destinations. The supply at each origin, demand at each store, and the unit costs are shown in the following table.

$/unit	Dest1	Dest2	Dest3	Dest4	Supply
STL	10	11	7	8	100
KC	13	20	7	9	150
CH	9	8	14	12	150
Demand	80	80	90	100

a. Solve the Transportation Problem to find the minimum cost shipping pattern.

Minimum Cost = ___________

Fill in the table with the optimal flows:

Flows	Dest1	Dest2	Dest3	Dest4	Supply
STL					100
KC					150
CH					150
Demand	80	80	90	100

b. Suppose now that KC must ship twice as much to Dest4 as it does to Dest3. Find the minimum cost shipping pattern.

Minimum Cost = _

Fill in the table with the optimal flows:

Flows	Dest1	Dest2	Dest3	Dest4	Supply
STL					100
KC					150
CH					150
Demand	80	80	90	100

c. Suppose now, using the condition in part b, that also STL can ship only to Dest2. Find the minimum cost shipping pattern.

Minimum Cost =

Fill in the table with the optimal flows:

Flows	Dest1	Dest2	Dest3	Dest4	Supply
STL	30	0	50	20	100
KC	0	30	40	30	150
CH	20	50	0	80	150
Demand	80	80	90	100