An iterative method for solving the Weber problem in \(\mathbb{R}^2\) with \(l_p\) norms, \(p\in (1,2)\), based in linear programming (Q2708112)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An iterative method for solving the Weber problem in \(\mathbb{R}^2\) with \(l_p\) norms, \(p\in (1,2)\), based in linear programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterative method for solving the Weber problem in \(\mathbb{R}^2\) with \(l_p\) norms, \(p\in (1,2)\), based in linear programming |
scientific article |
Statements
16 December 2001
0 references
continuous location
0 references
Weber problem
0 references
approximation
0 references
linear programming
0 references
An iterative method for solving the Weber problem in \(\mathbb{R}^2\) with \(l_p\) norms, \(p\in (1,2)\), based in linear programming (English)
0 references
A generalized form of the Weber problem requires finding a point in \(\mathbb{R}^N\) to minimize the sum of weighted distances (measured by an \(l_p\) norm) to \(m\) given points weighted by positive coefficients. The authors developed an iterative procedure for \(N=2\) and \(p\in [1,2)\) in order to give an approximate solution to the problem through linear programming. Comparative examples are analyzed and conclusions are presented.
0 references
