Paper Info
Title
Target setting with minimum improving costs in data envelopment analysis: A mixed integer linear programming approach
Abstract
This study addresses a problem called cost-minimizing target setting in data envelopment analysis (DEA) methodology. The problem is how to make an inefficient decision-making unit efficient by allocating to it as few organizational resources as possible, assuming that the marginal costs of reducing inputs or increasing outputs are known and available, which is different from previous furthest and closest DEA targets setting methods. In this study, an existed cost minimizing target setting heuristics approach based on input-oriented model is examined to show that there exist some limitations. This study develops a simple mixed integer linear programming to determine the desired targets on the strongly efficient frontier based on non-oriented DEA model considering the situation in the presence of known marginal costs of reducing inputs and increasing outputs simultaneously. Some experiments with the simulated datasets are conducted, and results show that the proposed model can obtain more accurate projections with lower costs compared with those from furthest and closest target setting approaches. Besides, the proposed model can be realistic and efficient in solving cost-minimizing target setting problem.
Year
DOI
Venue
2019
10.1111/exsy.12408
EXPERT SYSTEMS
Keywords
Field
DocType
closest targets,data envelopment analysis,mixed integer linear programming,non-oriented model
Data mining,Mathematical optimization,Computer science,Integer programming,Data envelopment analysis
Journal
Volume
Issue
ISSN
36.0
SP4.0
0266-4720
Citations 
PageRank 
References 
0
0.34
0
Authors
4
Name
Order
Citations
PageRank
Sheng Ang1333.39
Qingxian An211613.18
F. Yang348945.25
Xiang Ji4303.73