Paper Info
Title
Determining common weights in data envelopment analysis based on the satisfaction degree.
Abstract
The traditional data envelopment analysis model allows the decision-making units (DMUs) to evaluate their maximum efficiency values using their most favourable weights. This kind of evaluation with total weight flexibility may prevent the DMUs from being fully ranked and make the evaluation results unacceptable to the DMUs. To solve these problems, first, we introduce the concept of satisfaction degree of a DMU in relation to a common set of weights. Then a common-weight evaluation approach, which contains a max–min model and two algorithms, is proposed based on the satisfaction degrees of the DMUs. The max–min model accompanied by our Algorithm 1 can generate for the DMUs a set of common weights that maximizes the least satisfaction degrees among the DMUs. Furthermore, our Algorithm 2 can ensure that the generated common set of weights is unique and that the final satisfaction degrees of the DMUs constitute a Pareto-optimal solution. All of these factors make the evaluation results more satisfied and acceptable by all the DMUs. Finally, results from the proposed approach are contrasted with those of some previous methods for two published examples: efficiency evaluation of 17 forest districts in Taiwan and R&D project selection.
Year
DOI
Venue
2016
10.1057/jors.2016.35
JORS
Keywords
Field
DocType
data envelopment analysis, common weights, satisfaction degree
Mathematical optimization,Ranking,Computer science,Project selection,Data envelopment analysis,Maximum efficiency,Operations management
Journal
Volume
Issue
ISSN
67
12
0160-5682
Citations 
PageRank 
References 
0
0.34
0
Authors
5
Name
Order
Citations
PageRank
Jie Wu140936.02
Junfei Chu2758.71
Qingyuan Zhu300.68
Yongjun Li415714.37
Liang Liang5134492.90