Consider the below transportation problem. A product is produced in three cities, Atlanta, Boston, and Chicago, and sold in Lexington, Miami, and Nashville Transportation costs between cities shown in chart in the top.

Required:

a) Write a network flow model for this problem.

b) Write the linear program model for this problem.

c) Solve this with the transportation simplex method.

d) Is there an alternative optimal solution? Explain.

e) How many variables and how many constraints does

 

Transcribed Image Text:

Atlanta Boston Chicago Demand Lex 4 8 14 200 Customers Miami 10 16 18 300 Nash 6 6 10 250 Supply 100 300 350 a) W b) V c) S d) 1 e) F this Atlanta Boston Chicago Demand Lex 4 8 14 200 Customers Miami 10 16 18 300 Nash 6 6 10 250 Supply 100 300 350 a) W b) V c) S d) 1 e) F this

Answer rating: 100% (QA)

a Network Flow Model We can represent the transportation problem as a network flow model where the c... View the full answer