Discrete Decision Problems, Multiple Criteria Optimization Classes and Lexicographic Max-Ordering
The topic of this paper are discrete decision problems with multiple criteria. We first define discrete multiple criteria decision problems and introduce a classification scheme for multiple criteria optimization problems. To do so we use multiple criteria optimization classes. The main result is a characterization of the class of lexicographic max-ordering problems by two very useful properties, reduction and regularity. Subsequently we discuss the assumptions under which the application of this specific MCO class is justified. Finally we provide (simple) solution methods to find optimal decisions in the case of discrete multiple criteria optimization problems.
KeywordsDiscrete decision problems Classification Lexicographic max- ordering
Unable to display preview. Download preview PDF.
- [Ehr95]M. Ehrgott. Lexicographic max-ordering - a solution concept for multicriteria combinatorial optimization. In D. Schweigert, editor, Methods of Multicriteria Decision Theory, Proceedings of the 5th Workshop of the DGOR- Working Group Multicriteria Optimization and Decision Theory, pages 55–66, 1995.Google Scholar
- [Ehr97a]M. Ehrgott. A characterization of lexicographic max-ordering solutions. In Methods of Multicriteria Decision Theory, Proceedings of the 6th Workshop of the DGOR-Working Group Multicriteria Optimization and Decision Theory Alexisbad 1996, volume 2389 of Deutsche Hochschulschriften, 1997.Google Scholar
- [Ehr97b]M. Ehrgott. Classification and Methodology in Multiple Criteria Optimization. Shaker Verlag, Aachen, 1997. Ph.D. Thesis.Google Scholar