The Euclidean Multifacility Location Problem

Published Online:https://doi.org/10.1287/opre.36.3.485

To solve the Euclidean multifacility location problem, W. Miehle extended the Weiszfeld algorithm from one to several facilities. L. M. Ostresh established that the objective function for the iterates of Miehle's algorithm decreases in value, but his results do not give a convergence proof. In this paper we give a new extension of the Weiszfeld algorithm and by generalizing the Kuhn-Ostresh convergence theorem, prove separate results for convergence and for optimality, both under mild hypotheses.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.