A robust cross-efficiency data envelopment analysis model with undesirable outputs

被引:29
作者
Tavana, Madjid [1 ,2 ]
Toloo, Mehdi [3 ,4 ]
Aghayi, Nazila [5 ]
Arabmaldar, Aliasghar [6 ]
机构
[1] La Salle Univ, Business Syst & Analyt Dept, Business Analyt, Philadelphia, PA 19141 USA
[2] Univ Paderborn, Fac Business Adm & Econ, Business Informat Syst Dept, Paderborn, Germany
[3] Tech Univ Ostrava, Dept Syst Engn, Ostrava, Czech Republic
[4] Sultan Qaboos Univ, Coll Econ & Polit Sci, Dept Operat Management & Business Stat, Muscat, Oman
[5] Islamic Azad Univ, Ardabil Branch, Dept Math, Ardebil, Iran
[6] Golestan Univ, Dept Math, Gorgan, Golestan, Iran
关键词
Data envelopment analysis; Uncertain data; Undesirable outputs; Cross-efficiency evaluation; Robust optimization; Interval approach; NON-ARCHIMEDEAN EPSILON; DECISION-MAKING UNITS; IMPRECISE DATA; INTERVAL DATA; UNCERTAIN DATA; DEA; OPTIMIZATION; RANKING; POWER; FRONTIER;
D O I
10.1016/j.eswa.2020.114117
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Degenerate optimal weights and uncertain data are two challenging problems in conventional data envelopment analysis (DEA). Cross-efficiency and robust optimization are commonly used to handle such problems. We develop two DEA adaptations to rank decision-making units (DMUs) characterized by uncertain data and undesirable outputs. The first adaptation is an interval approach, where we propose lower- and upper-bounds for the efficiency scores and apply a robust cross-efficiency model to avoid problems of non-unique optimal weights and uncertain data. We initially use the proposed interval approach and categorize DMUs into fully efficient, efficient, and inefficient groups. The second adaptation is a robust approach, where we rank the DMUs, with a measure of cross-efficiency that extends the traditional classification of efficient and inefficient units. Results show that we can obtain higher discriminatory power and higher-ranking stability compared with the interval models. We present an example from the literature and a real-world application in the banking industry to demonstrate this capability.
引用
收藏
页数:16
相关论文
共 60 条
[1]   Cross-efficiency evaluation in the presence of flexible measures with an application to healthcare systems [J].
Abolghasem, Sepideh ;
Toloo, Mehdi ;
Amezquita, Santiago .
HEALTH CARE MANAGEMENT SCIENCE, 2019, 22 (03) :512-533
[2]   Revenue Efficiency Measurement With Undesirable Data in Fuzzy DEA [J].
Aghayi, Nazila .
2016 7TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS, MODELLING AND SIMULATION (ISMS), 2016, :109-113
[3]   Efficiency measurement of DMUs with undesirable outputs under uncertainty based on the directional distance function: Application on bank industry [J].
Aghayi, Nazila ;
Maleki, Bentolhoda .
ENERGY, 2016, 112 :376-387
[4]   Robust efficiency measurement with common set of weights under varying degrees of conservatism and data uncertainty [J].
Aghayi, Nazila ;
Tavana, Madjid ;
Raayatpanah, Mohammad Ali .
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2016, 10 (03) :385-405
[5]   A polynomial-time algorithm for finding ε in DEA models [J].
Amin, GR ;
Toloo, M .
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (05) :803-805
[6]   Mixed uncertainties in data envelopment analysis: A fuzzy-robust approach [J].
Amirkhan, Mohammad ;
Didehkhani, Hosein ;
Khalili-Damghani, Kaveh ;
Hafezalkotob, Ashkan .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 103 :218-237
[7]   A PROCEDURE FOR RANKING EFFICIENT UNITS IN DATA ENVELOPMENT ANALYSIS [J].
ANDERSEN, P ;
PETERSEN, NC .
MANAGEMENT SCIENCE, 1993, 39 (10) :1261-1265
[8]   A new robust DEA model and super-efficiency measure [J].
Arabmaldar, Aliasghar ;
Jablonsky, Josef ;
Saljooghi, Faranak Hosseinzadeh .
OPTIMIZATION, 2017, 66 (05) :723-736
[9]   SOME MODELS FOR ESTIMATING TECHNICAL AND SCALE INEFFICIENCIES IN DATA ENVELOPMENT ANALYSIS [J].
BANKER, RD ;
CHARNES, A ;
COOPER, WW .
MANAGEMENT SCIENCE, 1984, 30 (09) :1078-1092
[10]   Robust solutions of Linear Programming problems contaminated with uncertain data [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2000, 88 (03) :411-424