On the Convergence of a Hyperboloid Approximation Procedure for the Perturbed Euclidean Multifacility Location Problem

J. B. Rosen and G. L. Xue
Additional contact information
J. B. Rosen: University of Minnesota, Minneapolis, Minnesota
G. L. Xue: University of Vermont, Burlington, Vermont

Operations Research, 1993, vol. 41, issue 6, 1164-1171

Abstract: For the Euclidean single facility location problem, E. Weiszfeld proposed a simple closed-form iterative algorithm in 1937. Later, numerous authors proved that it is a convergent descent algorithm. In 1973, J. Eyster, J. White and W. Wierwille extended Weiszfeld's idea and proposed a Hyperboloid Approximation Procedure (HAP) for solving the Euclidean multifacility location problem. They believed, based on considerable computational experience, that the HAP always converges. In 1977, Ostresh proved that the HAP is a descent algorithm under certain conditions. In 1981, Morris proved that a variant of the HAP always converges. However, no convergence proof for the original HAP has ever been given. In this paper, we prove that the HAP is a descent algorithm and that it always converges to the minimizer of the objective function from any initial point.

Keywords: facilities/equipment planning: location; transportation: location model (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.41.6.1164 (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:41:y:1993:i:6:p:1164-1171

Access Statistics for this article

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