73-220-Lecture15-Soln

73-220-Lecture15-Soln - IntegerProgramming:Binary...

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

1 Integer Programming: Binary  Decision Variables 73-220 Lecture 15 – Solution

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

View Full Document
2 Set Covering Example There are 6 cities in Kilroy County.  The county must  determine where to build central fire stations.  The county  wants to build the minimum number of central fire stations  needed to ensure that at least one fire station is within 15  minutes (driving time) of each city.  The times (in minutes)  required to drive between the cities in  Kilroy county are  given in the table. Formulate an IPP that will tell Kilroy how  many fire stations should be built and where they should be  located.
3 Set Covering Example contd. To From City 1 City 2 City 3 City 4 City 5 City 6 City 1 0 10 20 30 30 20 City 2 10 0 25 35 20 10 City 3 20 25 0 15 30 20 City 4 30 35 15 0 15 25 City 5 30 20 30 15 0 14 City 6 20 10 20 25 14 0

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

View Full Document
4 Formulation The first step is to determine the cities which are within
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 9

73-220-Lecture15-Soln - IntegerProgramming:Binary...

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

View Full Document
Ask a homework question - tutors are online