Supply Chain Management with excel

Problem: Dr. P. and her husband are bringing a new restaurant franchise into town. They are considering potential sites and would like to minimize the initial investment involved with purchasing locations. However, they are very concerned about delivery time and want to make sure that every neighborhood in Wilmington can have food delivered in 15 minutes or less. To start analyzing the situation, Dr. Phas divided the city into 10 neighborhoods (A-J) and is currently considering a total of 8 different locations. Dr. P. is seeking her students' help and has formulated the following linear programming model: Let x = 1 if location is selected: 0 otherwise (for j = 1, 2, 3. 4. 5. 6. 7. & 8). Objective Function: Min 100x1 + 120x2 + 90x3 + 135x4 + 75x5 +85x6 + 110x7 + 135x8 ($ thousands) Subject to constraints: x1 + x2 + x5 + x7 1 (Neighborhood A constraint) x1 + x2 + x3 2 1 (Neighborhood B constraint) X5 X6 + x 2 1 INeighborhood C constraint) x1 + x4 + X7 21 INeighborhood D constraint) x2 + x3 - Neighborhood E constraint) X3 X4 X8 Neighborhood F constraint) X2 5+X71 Neighborhood G constraint) x1 + x4 + x6 = 1 INeighborhood H constraint) X1 X6 + 8 = 1 Neighborhood constraint) x1 + x2 7 2 1 INeighborhood constraint Which of the locations is the most expensive? O Location 3 O Location 2 Location 1 O Location 4 O Location 5