A polynomial time dual algorithm for the Euclidean multifacility location problem

G. L. Xue, J. B. Rosen, P. M. Pardalos

Research output: Contribution to journalArticle

10 Scopus citations

Abstract

The Euclidean multi-facility location (EMFL) problem is one of locating new facilities in the Euclidean space with respect to existing facilities. The problem consists of finding locations of new facilities which will minimize a total cost function which consists of a sum of costs directly proportional to the Euclidean distances between the new facilities, and costs directly proportional to the Euclidean distances between new and existing facilities. In this paper, it is shown that the dual of EMFL proposed by Francis and Cabot is equivalent to the maximization of a linear function subject to convex quadratic inequality constraints and therefore can be solved in polynomial time by interior point methods. We also establish a theorem on the duality gap and present a procedure for recovering the primal solution from an interior dual feasible solution.

Original languageEnglish (US)
Pages (from-to)201-204
Number of pages4
JournalOperations Research Letters
Volume18
Issue number4
DOIs
StatePublished - Feb 1996
Externally publishedYes

Keywords

  • Convex programming
  • Facilities location
  • Polynomial time algorithm
  • Self-concordant barrier

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A polynomial time dual algorithm for the Euclidean multifacility location problem'. Together they form a unique fingerprint.

  • Cite this