Abstract
Thekey problem of the Euclidean multifacility location (EMFL) problem is to decide whether a givendead point is optimal. If it is not optimal, we wish to compute a descent direction. This paper extends the optimality conditions of Calamai and Conn and Overton to the case when the rows of the active constraints matrix are linearly dependent. We show that linear dependence occurs wheneverG, the graph of the coinciding facilities, has a cycle. In this case the key problem is formulated as a linear least squares problem with bounds on the Euclidean norms of certain subvectors.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.G. Busacker and T.L. Saaty,Finite Graphs and Networks (McGraw-Hill, New York, 1965).
S. Busovaca, “Handling degeneracy in a nonlinearl 1 algorithm,” Technical Report CS85 34, University of Waterloo (Waterloo, Ontario, 1985).
P.H. Calamai, “On numerical methods for continuous location problems,” Ph.D. Thesis, University of Waterloo (Waterloo, Ontario, 1983).
P.H. Calamai and C. Charalambous, “Solving multifacility location problems, involving Euclidean distances,” Naval Research Logistics Quarterly 27 (1980) 609–620.
P.H. Calamai and A.R. Conn, “A stable algorithm for solving the multifacility location problem involving Euclidean distances,” SIAM Journal on Scientific and Statistical Computing 1 (1980) 512–526.
P.H. Calamai and A.R. Conn, “A second-order method for solving the continuous multifacility location problem,” in: G.A. Watson, ed.,Numerical Analysis: Proceedings of the Ninth Biennial Conference, Dundee, Scotland, Lecture Notes in Mathematics 912 (Springer-Verlag, Berlin, 1982), pp. 1–25.
A. Dax, “An efficient algorithm for solving the rectilinear multifacility location problem” submitted for publication in IMA Journal of Numerical Analysis (1984).
A. Dax, “An efficient clustering technique for solving the Euclidean multifacility location problem,” in preparation (1986).
M.L. Overton, “A quadratically convergent method for minimizing a sum of Euclidean norms,” Mathematical Programming 27 (1983) 34–63.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dax, A. A note on optimality conditions for the Euclidean. Multifacility location problem. Mathematical Programming 36, 72–80 (1986). https://doi.org/10.1007/BF02591990
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02591990