Annals of Operations Research

, 167:327

On the convergence of the generalized Weiszfeld algorithm

Authors

    • Steven G. Mihaylo College of Business and EconomicsCalifornia State University-Fullerton
Article

DOI: 10.1007/s10479-008-0336-z

Cite this article as:
Drezner, Z. Ann Oper Res (2009) 167: 327. doi:10.1007/s10479-008-0336-z

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.

Keywords

Location Weber problem Weiszfeld

Copyright information

© Springer Science+Business Media, LLC 2008