Properties of a multifacility location problem involving euclidian distances

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.

[1]  John A. White.  A Quadratic Facility Location Problem , 1971 .

[2]  G. O. Wesolowsky,et al.  Technical Note - The Optimal Location of New Facilities Using Rectangular Distances , 1971, Oper. Res..

[3]  A. Pritsker,et al.  Locating New Facilities with Respect to Existing Facilities , 1970 .

[4]  Elmor L. Peterson.  Symmetric Duality for Generalized Unconstrained Geometric Programming , 1970 .

[5]  Cabot A.Victor,et al.  A Network Flow Solution to a Rectilinear Distance Facility Location Problem , 1970 .

[6]  Davinder Bhatia,et al.  A Note on Duality Theorem for a Nonlinear Programming Problem , 1970 .

[7]  Nonlinear Nondifferentiable Programming in Complex Space , 1970 .

[8]  R. Love.  Locating facilities in three-dimensional space by convex programming , 1969 .

[9]  I. Katz.  On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems , 1969 .

[10]  Davinder Bhatia,et al.  Nonlinear programming in complex space , 1969 .

[11]  Thomas E. Vollmann,et al.  An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[12]  Roger C. Vergin,et al.  An Algorithm and Computational Procedure for Locating Economic Facilities , 1967 .

[13]  F. Hillier,et al.  Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities , 1966 .

[14]  S. Sinha.  A Duality Theorem for Nonlinear Programming , 1966 .

[15]  S. Sinha.  An Extension of a Theorem on Supports of a Convex Function , 1966 .

[16]  R. Bellman.  An Application of Dynamic Programming to Location—Allocation Problems , 1965 .

[17]  Harold W. Kulin,et al.  AN EFFICIENT ALGORITHM FOR THE NUMERICAL SOLUTION OF THE GENERALIZED WEBER PROBLEM IN SPATIAL ECONOMICS , 1962 .