Extensions of the prudence principle to exploit a valued outranking relation
From MaRDI portal
Publication:1038343
DOI10.1016/j.ejor.2009.03.026zbMath1173.90422WikidataQ57641195 ScholiaQ57641195MaRDI QIDQ1038343
Publication date: 17 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.03.026
outranking relations; max-min; ranking problem; multi-criteria decision aid; prudence principle; prudent orders
90C29: Multi-objective and goal programming
90B50: Management decision making, including multiple objectives
Related Items
MPOC: an agglomerative algorithm for multicriteria partially ordered clustering, Variable consistency dominance-based rough set approach to preference learning in multicriteria ranking
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A prudent characterization of the ranked pairs rule
- Evaluation and decision models with multiple criteria. Stepping stones for the analyst.
- RUBIS: a bipolar-valued outranking method for the choice problem
- Preference modelling
- How to select and how to rank projects: The PROMETHEE method
- Exploitation of a crisp relation in a ranking problem
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems
- A method based on multiobjective optimization for deriving a ranking from a fuzzy preference relation.
- Logical foundation of fuzzy preferential systems with application to the electre decision aid methods
- Concordant outranking with multiple criteria of ordinal significance
- A new method for group decision support based on ELECTRE III methodology.
- A comparison between the prudent order and the ranking obtained with Borda's, Copeland's, Slater's and Kemeny's rules
- Generating Linear Extensions Fast
- A characterization of ‘min’ as a procedure for exploiting valued preference relations and related results
- A Theorem on Boolean Matrices
