Reducing the Pareto optimal set in MCDM using imprecise probabilities

Lev V. Utkin

International Journal of Operational Research, 2014, vol. 19, issue 1, 21-39

Abstract: An approach for reducing a set of Pareto optimal solutions on the basis of specific information about importance of criteria is proposed in the paper. The DM's judgments about criteria have a clear behaviour interpretation and can be used in various decision problems. It is shown that the imprecise probability theory can be successfully applied for formalising the available information which is represented by means of a set of probability measures. Simple explicit expressions instead of linear programming problems are derived for dealing with three decision rules: maximality, interval dominance and interval bound dominance rules. Numerical examples illustrate the proposed approach.

Keywords: multicriteria decision making; MCDM; imprecise probabilities; desirable gambles; probability measures; judgments; preferences; Pareto sets; optimal sets; maximality; interval dominance; interval bound dominance rules. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=57840 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:19:y:2014:i:1:p:21-39

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().