Refine
Year of publication
- 1999 (1)
Document Type
- Preprint (1)
Language
- English (1)
Has Fulltext
- yes (1)
Keywords
- robustness (1) (remove)
Faculty / Organisational entity
In this paper a new trend is introduced into the field of multicriteria location problems. We combine the robustness approach using the minmax regret criterion together with Pareto-optimality. We consider the multicriteria Weber 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. For this problem, we characterize the Pareto-optimal solutions within the set of robust locations for the original weighted sum-distance functions. These locations have both the properties of stability and non-domination which are required in robust and multicriteria programming.