Properties of a multifacility location problem involving euclidian distances
- 1 June 1972
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 19 (2) , 335-353
- https://doi.org/10.1002/nav.3800190209
Abstract
This paper considers a problem of locating new facilities in the plane with respect to existing facilities, the locations of which are known. The problem consists of finding locations of new facilities which will minimize a total cost function which consists of a sum of costs directly proportional to the Euclidian distances among the new facilities, and costs directly proportional to the Euclidian distances between new and existing facilities. It is established that the total cost function has a minimum; necessary conditions for a mimumum are obtained; necessary and sufficient conditions are obtained for the function to be strictly convex (it is always convex); when the problem is “well structured,” it is established that for a minimum cost solution the locations of the new facilities will lie in the convex hull of the locations of the existing facilities. Also, a dual to the problem is obtained and interpreted; necessary and sufficient conditions for optimum solutions to the problem, and to its dual, are developed, as well as complementary slackness conditions. Many of the properties to be presented are motivated by, based on, and extend the results of Kuhn's study of the location problem known as the General Fermat Problem.Keywords
This publication has 18 references indexed in Scilit:
- A Quadratic Facility Location ProblemA I I E Transactions, 1971
- Locating New Facilities with Respect to Existing FacilitiesA I I E Transactions, 1970
- A Network Flow Solution to a Rectilinear Distance Facility Location ProblemA I I E Transactions, 1970
- A Note on Duality Theorem for a Nonlinear Programming ProblemManagement Science, 1970
- Nonlinear Nondifferentiable Programming in Complex SpacePublished by Elsevier ,1970
- Locating facilities in three‐dimensional space by convex programmingNaval Research Logistics Quarterly, 1969
- On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium ProblemsSIAM Journal on Applied Mathematics, 1969
- Nonlinear programming in complex spaceJournal of Mathematical Analysis and Applications, 1969
- Quadratic Assignment Problem Algorithms and the Location of Indivisible FacilitiesManagement Science, 1966
- An Application of Dynamic Programming to Location—Allocation ProblemsSIAM Review, 1965