arrow
Return

Solving multiple criteria choice problems by interactive trichotomy segmentation

delete1999-03-01
delete12
PRE
AI
A
Andrzej Jaszkiewicz *
A
A.B. Ferhat
DOI:10.1016/S0377-2217(98)00216-1delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The paper describes a method for multiple criteria choice problems with an explicitly given but relatively large set of alternatives. The approach can be placed between methods with a priori specification of the decision maker's (DM's) preferences and interactive procedures. The method presented includes some interaction with the DM, but is based on an assumption that, at the beginning of the solution process, he/she has already relatively well-defined preferences. The DM's preferences are modeled with an outranking relation in the neighborhood of a reference profile in the nondominated set. This preference model is used in order to define a trichotomy of the non-dominated set in terms of accepting good alternatives, rejecting non-interesting ones and defining alternatives that can neither be accepted, nor rejected based on the available preference information. The method stops if the class of good alternatives is sufficiently small and if the DM is able to select one of them as the best compromise. otherwise, the DM can modify the preferential information by changing either the reference profile, or the thresholds used to build the outranking relation. In other words, the DM defines dynamically the three categories. The description of the procedure is followed by presentation of an application. (C) 1999 Elsevier Science B.V. All rights reserved.
Keywords:
multiple criteria choice
aspiration levels
outranking relation
trichotomy segmentation
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

No organization information available