返回
Distance-based consensus methods:: a goal programming approach
DOI:10.1016/S0305-0483(98)00052-8.png)
摘要
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.
Keyword:
group decisions
goal programming
multi-criteria
social OR
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.7K
被引数:
1.4W
机构
暂无机构信息
引用论文
A General Approach to the Non-Invasive Imaging of Transgenes Using Cis-Linked Herpes Simplex Virus Thymidine Kinase
Neoplasia
IF0
Behaviour and Welfare Impacts of Releasing Elephants from Overnight Tethers: A Zimbabwean Case Study
Animals
IF0
没有更多内容

