On an open problem in spherical facility location

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

In this paper we partially resolve an open problem in spherical facility location. The spherical facility location problem is a generalization of the planar Euclidean facility location problem. This problem was first studied by Katz and Cooper and by Drezner and Wesolowsky where a Weszfeld-like algorithm was proposed. This algorithm is very simple and does not require a line search. However, its convergence has been an open problem for more than ten years. In this paper, we prove that the sequence generated by the algorithm converges to the unique optimal solution under the condition that the oscillation of the sequence converges to zero. We conjecture that the algorithm is a descent algorithm and prove that the sequence generated by the algorithm converges to the optimal solution under this conjecture.

Original languageEnglish (US)
Pages (from-to)1-12
Number of pages12
JournalNumerical Algorithms
Volume9
Issue number1
DOIs
StatePublished - Mar 1 1995
Externally publishedYes

Keywords

  • Euclidean facility location
  • Spherical facility location
  • closed form iteration formula
  • convergence theorem
  • open problem

ASJC Scopus subject areas

  • Applied Mathematics

Fingerprint Dive into the research topics of 'On an open problem in spherical facility location'. Together they form a unique fingerprint.

Cite this