Mathematical Programming

, Volume 71, Issue 1, pp 71–76

The Fermat—Weber location problem revisited

  • J. Brimberg

DOI: 10.1007/BF01592245

Cite this article as:
Brimberg, J. Mathematical Programming (1995) 71: 71. doi:10.1007/BF01592245


The Fermat—Weber location problem requires finding a point in ℝN that minimizes the sum of weighted Euclidean distances tom given points. A one-point iterative method was first introduced by Weiszfeld in 1937 to solve this problem. Since then several research articles have been published on the method and generalizations thereof. Global convergence of Weiszfeld's algorithm was proven in a seminal paper by Kuhn in 1973. However, since them given points are singular points of the iteration functions, convergence is conditional on none of the iterates coinciding with one of the given points. In addressing this problem, Kuhn concluded that whenever them given points are not collinear, Weiszfeld's algorithm will converge to the unique optimal solution except for a denumerable set of starting points. As late as 1989, Chandrasekaran and Tamir demonstrated with counter-examples that convergence may not occur for continuous sets of starting points when the given points are contained in an affine subspace of ℝN. We resolve this open question by proving that Weiszfeld's algorithm converges to the unique optimal solution for all but a denumerable set of starting points if, and only if, the convex hull of the given points is of dimensionN.


Location theoryFermat—Weber problemWeiszfeld's iterative algorithm

Copyright information

© The Mathematical Programming Society, Inc 1995

Authors and Affiliations

  • J. Brimberg
    • 1
  1. 1.Department of Engineering ManagementRoyal Military College of CanadaKingstonCanada