A characterization of lexicographic max-ordering solutions (1996) [4 citations — 2 self]
Download:
|
|
by Matthias Ehrgott
University of Kaiserslautern, Department of Mathematics
http://www.mathematik.uni-kl.de/~wwwwi/preprints/reports/alexis.ps.gz
Add To MetaCart
Abstract:
In this paper we give the definition of a solution concept in multicriteria combinatorial optimization. We show how Pareto, max-ordering and lexicographically optimal solutions can be incorporated in this framework. Furthermore we state some properties of lexicographic max-ordering solutions, which combine features of these three kinds of optimal solutions. Two of these properties, which are desirable from a decison maker's point of view, are satisfied if and only if the solution concept is that of lexicographic max-ordering.
Citations
| 24 | Proper efficiency and the theory of vector maximization – Geoffrion - 1968 |
| 19 | Bicriterion Path Problems – Hansen - 1980 |
| 17 | On spanning tree problems with multiple objectives – Hamacher, Ruhe - 1994 |
| 9 | Lexicographic optimality in the multiple objective linear programming: The nucleolar solution – Marchi, Oviedo - 1992 |
| 3 | Lexicographic max-ordering -- a solution concept for multicriteria combinatorial optimization – Ehrgott - 1995 |
| 3 | Efficient Sets in Vector Maximum Problems - a Brief Survey – Gal - 1986 |
| 2 | On the nucleolus of NTU-games defined by multiple objective linear programs – Christensen, Lind, et al. - 1996 |
| 2 | Location problems from the multiple criteria perspective: Efficient solutions – Ogryczak - 1994 |
