Accession Number:

ADA123914

Title:

A Note on the Weiszfeld-Kuhn Algorithm for the General Fermat Problem.

Descriptive Note:

Management science research rept.,

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP

Personal Author(s):

Report Date:

1982-09-01

Pagination or Media Count:

10.0

Abstract:

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

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE