(a) Write out the formulation of the maximum covering problem for the network shown in Exercise 4.8 using a coverage distance of 18 if we are to locate P facilities. (b) For P = 1, what is the optimal...

(a) Write out the formulation of the maximum covering problem for the network shown in Exercise 4.8 using a coverage distance of 18 if we are to locate P facilities.

(b) For P = 1, what is the optimal location? Which demand nodes are covered? What is the total covered demand.

(c) For P = 2, what is the solution that you obtain using the greedy adding algorithm (without substitution)? Again, which demand nodes are covered? What is the total covered demand?

(d) What is the optimal solution to the maximum covering problem for P = 2?

Note: For this exercise as well as Exercises 4.8 and 4.9, you may want to input the problem into the SITATION software. This can be done using NET-SPEC.