On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem

Lawrence M. Ostresh
Additional contact information
Lawrence M. Ostresh: University of Wyoming, Laramie, Wyoming

Operations Research, 1978, vol. 26, issue 4, 597-609

Abstract: The location problem is to find a point M whose sum of weighted distances from m vertices in p -dimensional Euclidean space is a minimum. The best-known algorithm for solving the location problem is an iterative scheme devised by Weiszfeld in 1937. The procedure will not converge if some nonoptimal vertex is an iterate, however. This paper solves the problem of vertex iterates and presents a general proof permitting a variable step length (within certain bounds). This property is used, in particular, to show the convergence of a modified gradient Newton-Raphson type of procedure.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.4.597 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:26:y:1978:i:4:p:597-609

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().