On the convergence of the generalized Weiszfeld algorithm



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.


Location Weber problem Weiszfeld 

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Steven G. Mihaylo College of Business and EconomicsCalifornia State University-FullertonFullertonUSA

Personalised recommendations