Algebraic optimization: The Fermat-Weber location problem

R. Chandrasekaran, A. Tamir

Research output: Contribution to journalArticlepeer-review

Abstract

The Fermat-Weber location problem is to find a point in ℝn that minimizes the sum of the (weighted) Euclidean distances from m given points in ℝn. In this work we discuss some relevant complexity and algorithmic issues. First, using Tarski's theory on solvability over real closed fields we argue that there is an infinite scheme to solve the problem, where the rate of convergence is equal to the rate of the best method to locate a real algebraic root of a one-dimensional polynomial. Secondly, we exhibit an explicit solution to the strong separation problem associated with the Fermat-Weber model. This separation result shows that an ε-approximation solution can be constructed in polynomial time using the standard Ellipsoid Method.

Original languageEnglish
Pages (from-to)219-224
Number of pages6
JournalMathematical Programming
Volume46
Issue number1-3
DOIs
StatePublished - Jan 1990

Keywords

  • Algebraic optimization
  • ellipsoid algorithms
  • location theory

Fingerprint

Dive into the research topics of 'Algebraic optimization: The Fermat-Weber location problem'. Together they form a unique fingerprint.

Cite this