A manufacturer wants to construct warehouses in six different locations of the city to supply dry cells to his customers on time. The manufacturer wants to construct the minimum number of warehouses such that each warehouse is within 40 miles of at least one other warehouse. The following table provides the distance (in miles) between the locations.
A manufacturer wants to construct warehouses in six different locations of the city to supply dry cells to his customers on time. The manufacturer wants to construct the minimum number of warehouses such that each warehouse is within 40 miles of at least one other warehouse. The following table provides the distance (in miles) between the locations.


(1) Formulate and solve an integer linear program that can be used to determine the minimum number of warehouses needed to be constructed. What are their locations?
(2) Solve the IP in (1) by running Solver. What are the optimal solution and the optimal objective function value?

From Location A Location B Location C Location D Location E Location F Location A 35 40 45 60 70 Location B 35 40 70 75 Location C 45 50 50 Location D 40 50 Location E 30 Location F