.png){kind=icon}
.png){kind=icon}
Return
Distance-based consensus methods:: a goal programming approach
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0483(98)00052-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Several authors have proposed a social choice function based upon distance-consensus between different committee rankings. Under this framework, the total absolute disagreement between committees is minimised. The purpose of this paper is to formulate the underlying optimisation problem as a goal programming (GP) model. To do this, the following three GP formulations are proposed: (a) a linear weighting GP model, where consensus is established by the minimisation of the weighted aggregated disagreement, (b) a MINMAX GP model, where the consensus is defined as the minimisation of the maximum disagreement and (c) an extended GP model, which subsumes the two previous formulations as particular cases. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keywords:
group decisions
goal programming
multi-criteria
social OR
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
O
IF:
7.2
Papers:
3.7K
Citations:
1.4W
Organization
No organization information available