Choice Rules with Size Constraints for Multiple Criteria Decision Making
In outranking methods for Multiple Criteria Decision Making (MCDM), pair-wise comparisons of alternatives are often summarized through a fuzzy preference relation. In this paper, the binary preference relation is extended to pairs of subsets of alternatives in order to define on this basis a scoring function over subsets. A choice rule based on maximizing score under size constraint is studied, which turns to formulate as solving a sequence of classical location problems. For comparison with the kernel approach, the interior stability property of the selected subset is discussed and analyzed.
|Date of creation:||Jan 2004|
|Date of revision:|
|Contact details of provider:|| Postal: ESSEC Research Center, BP 105, 95021 Cergy, France|
Web page: http://www.essec.edu/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Fodor, Janos C. & Roubens, Marc, 1995. "Structure of transitive valued binary relations," Mathematical Social Sciences, Elsevier, vol. 30(1), pages 71-94, August.
- Bertrand Mareschal & Jean Pierre Brans & Philippe Vincke, 1984. "Prométhée: a new family of outranking methods in multicriteria analysis," ULB Institutional Repository 2013/9305, ULB -- Universite Libre de Bruxelles.
- Owen, Susan Hesse & Daskin, Mark S., 1998. "Strategic facility location: A review," European Journal of Operational Research, Elsevier, vol. 111(3), pages 423-447, December.
When requesting a correction, please mention this item's handle: RePEc:ebg:essewp:dr-04002. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sophie Magnanou)
If references are entirely missing, you can add them using this form.