Question

Consider the transportation problem in which two factories supply three stores with a commodity. The numbers of supply units available at sources 1 and 2 are 200 and 300; those demanded at stores 1, 2, and 3 are 100, 200, and 50, respectively. Units may be trans-shipped among the factories and the stores before reaching their final destination. Find the optimal shipping schedule based on the unit costs in the following Table. TABLE 5.45 Data for Problem 4 Factory Store 1 2 1 2 3 Factory 1 $0 $6 $7 $8 $9 Factory 2 $6 $0 $5 $4 $3 Store 1 $7 $2 $0 $5 $1 Store 2 $1 $5 $1 $0 $4 Store 3 $8 $9 $7 $6 $0

          Consider the transportation problem in which two factories supply three stores with a commodity. The numbers of supply units available at sources 1 and 2 are 200 and 300; those demanded at stores 1, 2, and 3 are 100, 200, and 50, respectively. Units may be trans-shipped among the factories and the stores before reaching their final destination. Find the optimal shipping schedule based on the unit costs in the following Table.
TABLE 5.45 Data for Problem 4
Factory Store
1 2 1 2 3
Factory 1 $0 $6 $7 $8 $9
Factory 2 $6 $0 $5 $4 $3
Store 1 $7 $2 $0 $5 $1
Store 2 $1 $5 $1 $0 $4
Store 3 $8 $9 $7 $6 $0

Consider the transportation problem in which two factories supply three stores with a commodity. The numbers of supply units available at sources 1 and 2 are 200 and 300; those demanded at stores 1, 2, and 3 are 100, 200, and 50, respectively. Units may be trans-shipped among the factories and the stores before reaching their final destination. Find the optimal shipping schedule based on the unit costs in the following Table.
TABLE 5.45 Data for Problem 4
Factory Store
1 2 1 2 3
Factory 1 06 78 9
Factory 26 05 43
Store 1 72 05 1
Store 21 51 04
Store 3 89 76 0

Added by Thomas M.

Question

Please give Ace some feedback