This is the app page of ODMO program for Choosing locations for new plants

There are N = 3 new assembly plants need to be located in 3 out of P = 6 possible areas. The locations of 6 possible areas are in the following table

Possible areas	1	2	3	4	5	6
x (km)
y (km)

The number of suppliers is S = 10. Assembly plants need all of 10 pieces from all suppliers to produce a final product. The cost of moving one piece from each suppliers and their locations are given the following table

Supplier	1	2	3	4	5	6	7	8	9	10
Cost of moving one piece ($/piece/km)
x (km)
y (km)

The number of required products of each plant are given in the following table

Plant	1	2	3
#Required product

Find the locations for 3 new assembly plants to minimize the delivery cost.

[CLICK] here to solve the optimization problem