Question: Consider the following data for a Transportation Problem with 4 origins (in column 1) and 6 destinations (in row 1). $/unit Atlanta Boston Denver Miami
Consider the following data for a Transportation Problem with 4 origins (in column 1) and 6 destinations (in row 1).
| $/unit | Atlanta | Boston | Denver | Miami | Montreal | Seattle | Supply |
| Chicago | 2 | 4 | 5 | 5 | 3 | 5 | 600 |
| Dallas | 1 | 3 | 3 | 6 | 1 | 4 | 400 |
| San Diego | 1 | 5 | 7 | 3 | 7 | 2 | 600 |
| Toronto | 4 | 2 | 3 | 5 | 2 | 6 | 600 |
| Demand | 150 | 200 | 200 | 400 | 300 | 300 |
|
- Suppose that the Canadian destination (Montreal) must be served from the Canadian origin (Toronto). (This means, Montreal must be served by Toronto, but Toronto can serve other places, too.) How much does this restriction increase the cost?
a. Minimum cost = ________________________
b. % increase over cost from #1a. = ______________
c. Fill in the table below with the optimal product flows in the empty box, the flow out of each origin in the rowsum column, and the flow into each destination in the colsum row.
| flows | Atlanta | Boston | Denver | Miami | Montreal | Seattle | Supply | rowsum |
| Chicago |
|
|
|
|
|
| 600 |
|
| Dallas |
|
|
|
|
|
| 400 |
|
| San Diego |
|
|
|
|
|
| 600 |
|
| Toronto |
|
|
|
|
|
| 600 |
|
| Demand | 150 | 200 | 200 | 400 | 300 | 300 |
|
|
| colsum |
|
|
|
|
|
|
|
|
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
