KLUEDO RSS FeedKLUEDO Dokumente/documents
https://kluedo.ub.uni-kl.de/index/index/
Mon, 03 Apr 2000 00:00:00 +0200Mon, 03 Apr 2000 00:00:00 +0200Robustness in the Pareto-solutions for the Multicriteria Weber Location Problem
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/521
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.F. R. Fernandez; S. Nickel; J. Puerto; A.M. Rodriguez-Chiapreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/521Mon, 03 Apr 2000 00:00:00 +0200