Jump to content

Fermat–Weber problem

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Michael Hardy (talk | contribs) at 03:03, 2 August 2013. The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In mathematics, statistics, and operations research, the Fermat–Weber problem is either of two closely related problems:

  • Geometric median, the problem of finding a point minimizing the sum of distances from given points
  • Weber problem, the problem of finding a point minimizing the sum of weighted distances from given (point, weight) pairs