Enhanced Multi-Objective Voting Data Envelopment Analysis Models with Common Set of Weights
Publish Year: 1399
نوع سند: مقاله ژورنالی
زبان: English
View: 321
This Paper With 14 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_MACO-1-2_005
تاریخ نمایه سازی: 2 بهمن 1399
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.
Keywords:
Multi-objective programming , Voting , Aggregation of preferences , Data envelopment analysis , Common set of weights , Ranking
Authors
Mohammad Izadikhah
Department of Mathematics, College of Science, Arak Branch, Islamic Azad University, Arak, Iran, P. O. Box: ۳۸۱۳۵/۵۶۷
Erdal Karapinar
Department of Medical Research, China Medical University, Taichung, Taiwan.