• search hit 1 of 1
Back to Result List

Robustness in the Pareto-solutions for the Multicriteria Weber Location Problem

  • 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.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Author:F. R. Fernandez, S. Nickel, J. Puerto, A.M. Rodriguez-Chia
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (50)
Document Type:Preprint
Language of publication:English
Year of Completion:1999
Year of Publication:1999
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2000/04/03
Tag:Multicriteria Location; robustness
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011