An Approach to Location Models Involving Sets as Existing Facilities
- 1 November 2003
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 28 (4) , 693-715
Abstract
In this paper, we deal with single facility location problems in a general normed space in which the existing facilities are represented by convex sets of points. The criterion to be satisfied by the service facility is the minimization of an increasing, convex function of the distances from the service facility to the closest point of each demand set. We obtain a geometrical characterization of the set of optimal solutions for this problem. Two remarkable cases—the classical Weber problem and the minimax problem with demand sets—are studied as particular instances of our problem. Finally, for the planar polyhedral case, we give an algorithm to find the solution set of the considered problems.Keywords
This publication has 19 references indexed in Scilit:
- Locating facilities by minimax relative to closest points of demand areasComputers & Operations Research, 2002
- A review of extensive facility location in networksEuropean Journal of Operational Research, 1996
- A discretizing algorithm for location problemsEuropean Journal of Operational Research, 1995
- The Fermat-Weber Problem and Inner-Product SpacesJournal of Approximation Theory, 1994
- Maximizing Concave Functions in Fixed Dimension1993
- On the uniqueness of optimal solutions in continuous location theoryEuropean Journal of Operational Research, 1985
- Geometrical properties of the Fermat-Weber problemEuropean Journal of Operational Research, 1985
- Localization in single facility locationEuropean Journal of Operational Research, 1984
- Optimal location of a facility relative to area demandsNaval Research Logistics Quarterly, 1980
- Absolute and monotonic normsNumerische Mathematik, 1961