Deriving a minimum distance-based collective preorder: a binary mathematical programming approach

DOI10.1007/s00291-009-0192-5zbMath1238.90077OpenAlexW2030580634MaRDI QIDQ421078

Khaled Jabeur, Jean-Marc Martel, Adel Guitouni

Publication date: 23 May 2012

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-009-0192-5

zbMATH Keywords

distance measuregroup decision-makingbinary relationsbinary linear programmingmembers' relative importancepreferences aggregation

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)

Related Items (1)

Dynamic systems based on preference graph and distance

Uses Software

• ELECTRE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A collective choice method based on individual preferences relational systems (p.r.s.)
• An ordinal sorting method for group decision-making
• A new index of power for simple n-person games
• Group preference aggregation methods employed in AHP: An evaluation and an intrinsic process for deriving members' weightages
• Determining the weights of criteria in the ELECTRE type methods with a revised Simos' procedure
• Distance-based and ad hoc consensus models in ordinal preference ranking
• An axiomatic approach to distance on partial orderings
• Ordinal Ranking with Intensity of Preference
• Priority Ranking and Consensus Formation
• Group Decision Making Using Cardinal Social Welfare Functions
• Criterion of distance between technical programming and socio-economic priority
• IMGD: an interactive method for multiobjective group decision aid
• Reaching a Consensus

This page was built for publication: Deriving a minimum distance-based collective preorder: a binary mathematical programming approach