Reducing the Pareto optimal set in MCDM using imprecise probabilities
by Lev V. Utkin
International Journal of Operational Research (IJOR), Vol. 19, No. 1, 2014

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.

Online publication date: Tue, 17-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com