## Abstract In this paper, a new trend is introduced into the field of multi‐criteria location problems. We combine the robustness approach using the minmax regret criterion together with Pareto‐optimality. We consider the multi‐criteria squared Euclidean minisum location problem which consists of
Multi-criteria minisum facility location problems
✍ Scribed by J. Puerto; F.R. Fernández
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 181 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1057-9214
No coin nor oath required. For personal study only.
✦ Synopsis
This paper deals with the multi-criteria Weber (minisum) problem. Several new solution concepts are introduced, related to ideas of equilibrium between the different aspects covered by the objectives. Structural results are presented characterizing the proposed solution sets and showing the relationships existing with the efficient sets in the point objective location problem. Also, algorithms to solve this problem for the polyhedral norm case are developed. The proposed approach is more general than previously studied on multi-criteria location problems and is particularly applicable in the real world when different scenarios must be compared.
📜 SIMILAR VOLUMES
## Abstract We consider the 𝓁~__p__~‐norm multi‐facility minisum location problem with linear and distance constraints, and develop the Lagrangian dual formulation for this problem. The model that we consider represents the most general location model in which the dual formulation is not found in t
In an earlier article we showed that, for facilities-location problems characterized by generalized distance norms and any even number of existing facilities, the optimal location of the new facility is at the intersection of the lines joining the pairs of facilities if these lines intersect at a si