A globally convergent algorithm for the Euclidean multiplicity location problem

J. B. Rosen, Guoliang Xue

Research output: Contribution to journalArticle

2 Scopus citations

Abstract

The Euclidean single facility location problem (ESFL) and the Euclidean multiplicity location problem (EMFL) are two special nonsmooth convex programming problems which have attracted a large literature. For the ESFL problem, there are algorithms which converge both globally and quadratically. For the EMFL problem, there are some quadratically convergent algorithms, but for global convergence, they all need nontrivial assumptions on the problem. In this paper, we present an algorithm for EMFL. With no assumption on the problem, it is proved that from any initial point, this algorithm generates a sequence of points which converges to the closed convex set of optimal solutions of EMFL.

Original languageEnglish (US)
Pages (from-to)357-366
Number of pages10
JournalActa Mathematicae Applicatae Sinica
Volume8
Issue number4
DOIs
StatePublished - Oct 1 1992
Externally publishedYes

ASJC Scopus subject areas

  • Applied Mathematics

Fingerprint Dive into the research topics of 'A globally convergent algorithm for the Euclidean multiplicity location problem'. Together they form a unique fingerprint.

  • Cite this