A Note on the Weiszfeld-Kuhn Algorithm for the General Fermat Problem.
Management science research rept.,
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Pagination or Media Count:
The General Fermat Problem, or Weber Problem, asks for a point that minimizes a weighted sum of the distances to m given points. The Weiszfeld-Kuhn algorithm is an iterative procedure that converges to an optimal point for all but a denumerable number of starting points. We give an amended version of the algorithm, that guarantees convergence. Author
- Theoretical Mathematics