基于公共权集的改进多目标投票数据包络分析模型

M. Izadikhah, E. Karapınar
{"title":"基于公共权集的改进多目标投票数据包络分析模型","authors":"M. Izadikhah, E. Karapınar","doi":"10.29252/MACO.1.2.5","DOIUrl":null,"url":null,"abstract":". The important issue of the aggregation preference is how to determine the weights associated with different ranking places and DEA models play an important role in this subject. DEA models use assignments of the same aggregate value (equal to unity) to evaluate multiple alternatives as efficient. Furthermore, overly diverse weights can appear, thus, the efficiency of different alternatives obtained by different sets of weights may be unable to be compared and ranked on the same basis. In order to solve two above problems, and rank all the alternatives on the same scale, in this paper, we propose a multiple objective programming (MOP) approach for generating a common set of weights in the DEA framework. Also, we develop a novel model to make a maximum discriminating among candidates’ rankings. Additionally, we present two scenarios to provide suitable strategies for solving the proposed MOP model.","PeriodicalId":360771,"journal":{"name":"Mathematical Analysis and Convex Optimization","volume":"9 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhanced Multi-Objective Voting Data Envelopment Analysis Models with Common Set of Weights\",\"authors\":\"M. Izadikhah, E. Karapınar\",\"doi\":\"10.29252/MACO.1.2.5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". The important issue of the aggregation preference is how to determine the weights associated with different ranking places and DEA models play an important role in this subject. DEA models use assignments of the same aggregate value (equal to unity) to evaluate multiple alternatives as efficient. Furthermore, overly diverse weights can appear, thus, the efficiency of different alternatives obtained by different sets of weights may be unable to be compared and ranked on the same basis. In order to solve two above problems, and rank all the alternatives on the same scale, in this paper, we propose a multiple objective programming (MOP) approach for generating a common set of weights in the DEA framework. Also, we develop a novel model to make a maximum discriminating among candidates’ rankings. Additionally, we present two scenarios to provide suitable strategies for solving the proposed MOP model.\",\"PeriodicalId\":360771,\"journal\":{\"name\":\"Mathematical Analysis and Convex Optimization\",\"volume\":\"9 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Analysis and Convex Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.29252/MACO.1.2.5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Analysis and Convex Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29252/MACO.1.2.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

。聚合偏好的重要问题是如何确定与不同排名位置相关联的权重,而DEA模型在这一问题中起着重要作用。DEA模型使用相同聚合值(等于单位)的分配来评估多个备选方案的效率。此外,还可能出现权值过于多样化的情况,因此,不同权值集合得到的不同方案的效率可能无法在同一基础上进行比较和排序。为了解决上述两个问题,并在同一尺度上对所有备选方案进行排序,本文提出了一种多目标规划(MOP)方法,用于在DEA框架中生成公共权重集。此外,我们还开发了一个新的模型来最大限度地区分候选人的排名。此外,我们提出了两种场景,为解决所提出的MOP模型提供了合适的策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Enhanced Multi-Objective Voting Data Envelopment Analysis Models with Common Set of Weights
. The important issue of the aggregation preference is how to determine the weights associated with different ranking places and DEA models play an important role in this subject. DEA models use assignments of the same aggregate value (equal to unity) to evaluate multiple alternatives as efficient. Furthermore, overly diverse weights can appear, thus, the efficiency of different alternatives obtained by different sets of weights may be unable to be compared and ranked on the same basis. In order to solve two above problems, and rank all the alternatives on the same scale, in this paper, we propose a multiple objective programming (MOP) approach for generating a common set of weights in the DEA framework. Also, we develop a novel model to make a maximum discriminating among candidates’ rankings. Additionally, we present two scenarios to provide suitable strategies for solving the proposed MOP model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信