{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

DMORMidterm03

# DMORMidterm03 - UF-ESI-6314 DMOR-Midterm-03.x1s Problem...

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

UF-ESI-6314 DMOR-Midterm-03.x1s Problem Definition Question 3 (20 points): Model the following problem as a linear program. Consider a communication problem involving the following set of cities: Atlanta, Boston, Cleveland, Detroit, and Evansville. Each pair of cities requests a certain amount of communication channels. The number of channels requested for each pair of cities is given below. 1 2 3 4 5 Atlanta Boston Cleveland Detroit Evansville Luther Setzer 1 NASA Pkwy EStop NEM3, Kennedy Space Center, FL 32899 page L 0 f 7 package page [jof ~G ~ (321) 544-7435 1 2 Atlanta - Boston: 6 1 3 Atlanta - Cleveland: 9 1 4 Atlanta - Detroit: 7 1 5 Atlanta - Evansville: 7 2 3 Boston - Cleveland: 10 2 4 Boston - Detroit: 9 2 5 Boston - Evansville: 4 3 4 Cleveland - Detroit: 8 3 5 Cleveland - Evansville: 7 4 5 Detroit - Evansville: 3

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

View Full Document
UF-ESI-6314 DMOR-Midterm-03.xls Problem Definition There are three networks that can satisfy these demands, and each network has a maximum capacity of 25 channels. The cost for assigning a channel to a network between city i and city j is given by: the connection fee for city i to the network plus the connection fee for city j to the network. The connection fee for each city to each network is given in the following table: Luther Setzer 1 NASA Pkwy EStop NEM3, Kennedy Space Center, FL 32899 page 2 of 7 package page 19 of36 (321) 544-7435
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 7

DMORMidterm03 - UF-ESI-6314 DMOR-Midterm-03.x1s Problem...

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

View Full Document
Ask a homework question - tutors are online