Abstract
In this paper we consider Weber-like location problems. The objective function is a sum of terms, each a function of the Euclidean distance from a demand point. We prove that a Weiszfeld-like iterative procedure for the solution of such problems converges to a local minimum (or a saddle point) when three conditions are met. Many location problems can be solved by the generalized Weiszfeld algorithm. There are many problem instances for which convergence is observed empirically. The proof in this paper shows that many of these algorithms indeed converge.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brimberg, J., & Love, R. F. (1993). Global convergence of a generalized iterative procedure for the minisum location problem with ℓ p distances. Operations Research, 41, 1153–1163.
Chandrasekaran, R., & Tamir, A. (1989). Open questions concerning Weiszfeld’s algorithm for the Fermat-Weber location problem. Mathematical Programming, 44, 293–295.
Drezner, T. (1994). Optimal continuous location of a retail facility, facility attractiveness, and market share: an interactive model. Journal of Retailing, 70, 49–64.
Drezner, T. (1995). Competitive facility location in the plane. In Z. Drezner (Ed.), Facility location: A survey of applications and methods (pp. 285–300).
Drezner, T., & Drezner, Z. (1997). Replacing discrete demand with continuous demand in a competitive facility location problem. Naval Research Logistics, 44, 81–95.
Drezner, Z., & Drezner, T. (1998). Applied location models. In G. A. Marcoulides (Ed.), Modern methods for business research (pp. 79–120). Mahwah: Erlbaum.
Drezner, T., & Drezner, Z. (2004). Finding the optimal solution to the Huff competitive location model. Computational Management Science, 1, 193–208.
Drezner, Z., Wesolowsky, G. O., & Drezner, T. (1998). On the logit approach to competitive facility location. Journal of Regional Science, 38, 313–327.
Drezner, Z., Scott, C. H., & Song, J. S. (2003). The central warehouse location problem revisited. IMA Journal of Management Mathematics, 14, 321–336.
Eyster, J. W., White, J. A., & Wierwille, W. W. (1973). On solving multifacility location problems using a hyperboloid approximation procedure. AIIE Transactions, 5, 1–6.
Kuhn, H. W. (1967). On a pair of dual nonlinear programs. In J. Abadie (Ed.), Methods of nonlinear programming. Amsterdam: North-Holland.
Love, R. F., Morris, J. G., & Wesolowsky, G. O. (1988). Facilities location: models and methods. New York: North-Holland.
Morris, J. G. (1981). Convergence of the Weiszfeld algorithm for Weber problems using a generalized distance function. Operations Research, 29, 37–48.
Ostresh, L. M. Jr. (1978). On the convergence of a class of iterative methods for solving the Weber location problem. Operations Research, 26, 597–609.
Puerto, J., & Rodriguez-Chia, A. M. (1999). Location of a moving service facility. Mathematical Methods of Operations Research, 49, 373–393.
Weber, A. (1909). Über Den Standort Der Industrien, 1. Teil: Reine Theorie Des Standortes. Tübingen. English translation: On the location of industries. University of Chicago Press, Chicago (1929). (English translation by C.J. Friedeich (1957), Theory of the location of industries. Chicago University Press, Chicago).
Weiszfeld, E. (1937). Sur le Point Pour Lequel la Somme des Distances de n Points Donnés est Minimum. Tohoku Mathematical Journal, 43, 355–386.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Drezner, Z. On the convergence of the generalized Weiszfeld algorithm. Ann Oper Res 167, 327–336 (2009). https://doi.org/10.1007/s10479-008-0336-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-008-0336-z