On the Convergence of Miehle's Algorithm for the 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 Minnesota, Minneapolis, Minnesota

Operations Research, 1992, vol. 40, issue 1, 188-191

Abstract: For the Euclidean single facility location problem, E. Weiszfeld proposed a simple iterative algorithm in 1937. Later, it was proved by numerous authors that it is a convergent descent algorithm. W. Miehle extended Weiszfeld's algorithm to solve the Euclidean multifacility location problem. Then, L. M. Ostresh proved that Miehle's algorithm is a descent algorithm. Recently, F. Rado modified Miehle's algorithm and provided several sets of sufficient conditions for the modified algorithm to converge. He also indicated that the convergence of Miehle's algorithm was an open problem. In this paper, the relationship between Miehle's multifacility location algorithm and Weiszfeld's single facility location algorithm is analyzed. Counterexamples show that Miehle's algorithm may converge to nonoptimal points for well structured problems.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.1.188 (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:40:y:1992:i:1:p:188-191

Access Statistics for this article

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