{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

DMOR-05-05

DMOR-05-05 - UF-ESI-6314 DMOR-05-05 Problem Statement page...

This preview shows pages 1–3. Sign up to view the full content.

UF-ESI-6314 DMOR-05-05.xls Problem Statement page 1 of 12 05-05. A computer chip company needs to supply cities depicted in the graph below with computer chips. The number of computer chips required is given in red alongside the nodes (demands are in millions of chips). The company can open up distribution centers at a cost of \$40 million per center. At most one distribution center can be opened in any city. If a distribution center is located in a city, it can be used to produce and ship at most 10 million chips to demand centers in its own city or to other cities. Shipping costs between cities are given by the blue numbers in the graph below. Each shipping cost is in dollars, and is a per-unit flow cost (e.g., shipping 2 million chips from LA to DEN costs \$10 million). Finally, note that chips can be shipped through cities if needed (e.g., chips can be sent from Denver to Boston via Chicago). Formulate and solve (using Excel) an integer program to minimize the cost of facility location plus shipping costs for the computer company. LA SEA DEN DAL CHI ATL BOS 4 6 3 3 5 2 4 3 6 4 8 5 6 5 4 7 5 5 6 Luther Setzer 1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899 (321) 544-7435

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
UF-ESI-6314 DMOR-05-05.xls SEA page 2 of 12 Find the shortest path from the SEA node to all other nodes using Dijkstra's algorithm. LA SEA DEN DAL CHI ATL BOS 4 6 3 3 5 2 4 3 6 4 8 5 6 5 4 7 5 5 6 0 6 5 9 10 13 13 Luther Setzer 1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899 (321) 544-7435
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 12

DMOR-05-05 - UF-ESI-6314 DMOR-05-05 Problem Statement page...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online