Question
Shown below is the data for a Transportation Problem with 5 origins (Dallas, Denver, Juarez, Tucson and Wichita) and 6 destinations (Store 1-Store 6). The
Shown below is the data for a Transportation Problem with 5 origins (Dallas, Denver, Juarez, Tucson and Wichita) and 6 destinations (Store 1-Store 6). The supply at each origin, demand at each store, and the unit costs are shown in the following table.
$/unit | Store 1 | Store 2 | Store 3 | Store 4 | Store 5 | Store 6 | Supply |
Dallas | 112 | 145 | 156 | 171 | 210 | 185 | 1000 |
Denver | 123 | 154 | 217 | 232 | 164 | 155 | 1500 |
Juarez | 96 | 83 | 152 | 125 | 154 | 85 | 2000 |
Tucson | 126 | 153 | 177 | 169 | 173 | 125 | 1000 |
Wichita | 104 | 132 | 187 | 154 | 157 | 162 | 1500 |
Demand | 1000 | 1000 | 1000 | 1000 | 1200 | 1300 |
|
Now suppose that the demand at both Store 1 and Store 2 increases by 300 (at each store). Now what is the minimal cost and shipping pattern?
Minimum Cost = ____________
Fill in the table with the optimal flows for the solution with the expansion:
$/unit | Store1 | Store2 | Store3 | Store4 | Store5 | Store6 | Supply | Rowsum |
Dallas |
|
|
|
|
|
| 1000 |
|
Denver |
|
|
|
|
|
| 1500 |
|
Juarez |
|
|
|
|
|
| 2000 |
|
Tucson |
|
|
|
|
|
| 1000 |
|
Wichita |
|
|
|
|
|
| 1500 |
|
Demand | 1300 | 1300 | 1000 | 1000 | 1200 | 1300 | ||
colsum |
|
|
|
|
|
|
Which origins, if any, do not send all their supply? ___________________________
Which destinations, if any, do not receive all their demand? ___________________________
Please screenshot the solver solution ! thanks !!
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access with AI-Powered Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started