Robust facility location (Q1416795): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q161393 |
Normalize DOI. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s001860300294 / rank | |||
Property / author | |||
Property / author: Emilio Carrizosa / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2051213637 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S001860300294 / rank | |||
Normal rank |
Latest revision as of 19:47, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Robust facility location |
scientific article |
Statements
Robust facility location (English)
0 references
16 December 2003
0 references
A facility is to be located in a planar region minimising the sum of weighted distances to a finite set of points, but only an estimate of the weights is known. It is therefore proposed to find instead the most robust location, where robustness of a location is measured as the minimum deviation in weights from the estimate which would lead to a weighted sum of distances above an a-priori fixed allowable upper bound. When this deviation is measured by a monotone norm of the weight-differences-vector, robustness may be maximised by way of standard fractional programming techniques. In some special cases, like spatial distance measured by a polyhedral norm and weight-deviations measured through maximum norm, the problem may be solved using more direct finite enumeration algorithms.
0 references
planar facility location
0 references
Weber problem
0 references
uncertain weights
0 references
fractional programming
0 references