Reconsider Problem 9.3. Suppose now that the demand at each of the destinations has been reduced by 10, so that the new demands are 20, 30, and 20 at destinations 1, 2, and 3, respectively. Introduce a dummy destination in order to satisfy the feasible solutions property and then repeat parts a and b to determine how much each source should supply to each destination for this new version of the problem, 

a. Formulate and solve a spreadsheet model for this problem without introducing a dummy destination. 

b. Now convert this problem into a minimum-flow cost flow problem by introducing a dummy destination and making the other needed adjustments. Then draw a network similar to Figure 9.3 for this minimum-cost flow problem.) 

c. Formulate and solve a spreadsheet model for the minimum-cost flow problem obtained in part b. Then compare the resulting optimal flow plan (while ignoring the flows into the dummy destination) with the optimal flow plan obtained in part a without using a dummy destination.

Data from Problem 9.3

Consider the transportation problem having the unit shipping costs shown in the following table. 

Transcribed Image Text:

Source 1 2 Demand 1 6 5 30 Destination 2 7 8 40 3 4 6 30 Supply 40 60