Goods from the warehouse will $be$ delivered $to$ the communities $by$ plane.

The price $of$ a single delivery $to$ a community $is$ proportional $to$ the distance

between the ware$-$house and the community. Each community will need $a$

number $of$ deliveries from the warehouse which depends $on$ the size $of$ the

community. Dog River will require $20$ deliveries, Springfield $14,$ Empire

Falls $8,$ and Worthing $24.$ The goal $isto$ locate the warehouse, $i.e.$ find $(x,y)-$

coordinates, $so$ that the total cost $of$ all deliveries $is$ minimized. Formulate

this problem $asanNLP.$