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

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1982
Accession Number
ADA123914

Entities

People

  • Chang-sung Yu
  • Egon Balas

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Center Of Gravity
  • Contracts
  • Convergence
  • Fail Safe
  • Guarantees
  • Mathematics
  • Military Research
  • Pennsylvania
  • Probability
  • Schools
  • Sequences
  • Students
  • Universities

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Mathematical Modeling and Probability Theory.