𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Robustness in the Pareto-solutions for the multi-criteria minisum location problem

✍ Scribed by F.R. Fernández; S. Nickel; J. Puerto; A.M. Rodríguez-Chía


Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
460 KB
Volume
10
Category
Article
ISSN
1057-9214

No coin nor oath required. For personal study only.

✦ Synopsis


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 simultaneously minimizing a number of weighted sum‐distance functions and the set of Pareto‐optimal locations as its solution concept. The Pareto‐optimal solutions for the set of robust locations with respect to the original weighted sum‐distance functions is completely characterized. These Pareto‐optimal solutions have both the properties of stability and non‐domination which are required in robust and multi‐criteria programming. Copyright © 2001 John Wiley & Sons, Ltd.


📜 SIMILAR VOLUMES


Social learning for solving complex prob
✍ S. Van Bommel; N. Röling; N. Aarts; E. Turnhout 📂 Article 📅 2009 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 319 KB 👁 2 views

## Abstract Social learning has been championed as a promising approach to address complex resource problems. According to theory, social learning requires several pre‐conditions to be met, including (1) a divergence of interests, (2) mutual interdependence and (3) the ability to communicate. This