A solid waste company must locate 2 disposal sites to service the demand (tons per day) of the 5 communities detailed in the following table.

Community 1 2 3 4 5 Demand 60 90 35 85 70 E-W coordinate 0 4 30 20 16 N-S coordinate 0 30 8 17 15 Each site will be able to handle up to 200 tons per day, and planners want to select the site locations to minimize to total ton-miles of hauling from community (mile) coordinates shown in the table to disposal sites. Assume that hauling distance is proportional to straight-line distance.

(a) Formulate this location-allocation problem as a constrained NLP.

(b) Use class optimization software to start from reasonable locations and compute at least a local optimum.