Question: Formulate an integer programming model that could be used to find the minimum number of locations necessary to provide coverage to all areas. Let x
Formulate an integer programming model that could be used to find the minimum number of locations necessary to provide coverage to all areas.
Let xi =
1 if a substation is located at area i 0 otherwise |
for i = L, M, N, O, P, Q, R.


SONAN MACHA Area 2,4 . o www WARRIOR) Grave City is considering the relocation of several police substations to obtair Potential Locations for Substations Areas Covered L 2, 4, 5 M 4, 5, 6 N 3,4,6 0 1, 5, 7 1, 5, 6, 7 Q 1, 3, 5 R 1, 2, 5, 7 (a) Formulate an integer programming model that could be used to find the Min s.t. Area 1 Area 2 Area 3 Area 4 Area 5 Area 6 Area 7 Area 5 Area 6 Area 7 (b) Solve the problem in part (a). What locations should be given substations? (Select all that apply.) - Location L - Location M - Location N - Location o - Location p Location Q Location R Need Help? Submit
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
