Reducing the Pareto optimal set in MCDM using imprecise probabilities. (1st January 2014)
- Record Type:
- Journal Article
- Title:
- Reducing the Pareto optimal set in MCDM using imprecise probabilities. (1st January 2014)
- Main Title:
- Reducing the Pareto optimal set in MCDM using imprecise probabilities
- Authors:
- Utkin, Lev V.
- 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.
- Is Part Of:
- International journal of operational research. Volume 19:Number 1(2014)
- Journal:
- International journal of operational research
- Issue:
- Volume 19:Number 1(2014)
- Issue Display:
- Volume 19, Issue 1 (2014)
- Year:
- 2014
- Volume:
- 19
- Issue:
- 1
- Issue Sort Value:
- 2014-0019-0001-0000
- Page Start:
- 21
- Page End:
- 39
- Publication Date:
- 2014-01-01
- Subjects:
- multi-criteria decision making -- MCDM -- imprecise probabilities -- desirable gambles -- sets of probability measures -- judgments -- preferences -- Pareto set
Operations research -- Periodicals
003.05 - Journal URLs:
- http://www.inderscience.com/browse/index.php?journalID=170 ↗
http://www.inderscience.com/ ↗ - Languages:
- English
- ISSNs:
- 1745-7645
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - BLDSS-3PM
British Library STI - ELD Digital store - Ingest File:
- 8871.xml