##
**Solution of the multisource Weber and conditional Weber problems by d. -c. programming.**
*(English)*
Zbl 0979.90099

Summary: D.-c. programming is a recent technique of global optimization that allows the solution of problems whose objective function and constraints can be expressed as differences of convex (i.e., d.-c.) functions. Many such problems arise in continuous location theory. The problem first considered is to locate a known number of source facilities to minimize the sum of weighted Euclidean distances between a user’s fixed location and the source facility closest to the location of each user. We also apply d.-c. programming to the solution of the conditional Weber problem, an extension of the multisource Weber problem, in which some facilities are assumed to be already established. In addition, we consider a generalization of Weber’s problem, the facility location problem with limited distances, where the effective service distance becomes a constant when the actual distance attains a given value. Computational results are reported for problems with up to 10,000 users and two new facilities, 50 users and three new facilities, 1,000 users, 20 existing facilities and one new facility or 200 users, 10 existing and two new facilities.

### MSC:

90C26 | Nonconvex programming, global optimization |

90C08 | Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) |