Additive slacks-based measure: Computational strategy and extension to network DEA

作     者：Chen, Kun Zhu, Joe 

作者机构：Nanjing Audit Univ Coll Auditing & Evaluat Nanjing 211815 Jiangsu Peoples R China Worcester Polytech Inst Foisie Business Sch Worcester MA 01609 USA 

出 版 物：《OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE》 (国际管理科学杂志)

年 卷 期：2020年第91卷

页      面：102022-000页

核心收录：

学科分类：12[管理学] 120202[管理学-企业管理（含：财务管理、市场营销、人力资源管理）] 0202[经济学-应用经济学] 02[经济学] 1202[管理学-工商管理] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 

基　　金：National Natural Science Foundation of China 

主　　题：Data envelopment analysis (DEA) Additive slacks-based measure Russell measure Second order cone programming Network DEA 

摘      要：The current paper visits a set of data envelopment analysis (DEA) models that identify inefficiency by optimizing input and output slacks. These slacks are aggregated either in an additive or ratio form. Only the ratio slacks-based DEA models can be solved as a linear program and generate a DEA score between zero and unity. The additive slacks-based model can be equivalent to the Russell graph measure and converted into a second order cone programming (SOCP) problem whose solving procedure has become a mature technology. As such, the additive slacks-based model can also yield a DEA score between zero and unity. This study shows that the additive slacks-based model can be applied to modelling network DEA where the internal structures of decision making units (DMUs) are of interest. The additive slacks-based network DEA can be solved using SOCP technique and adapted to the preference of the decision maker by choosing the weights for aggregating individual components in the network structures. It is shown that the additive slacks-based approach can yield divisional efficiencies of Pareto optimal equivalences to be selected by the decision maker when compared to the existing ratio slacks-based measure. An example and solving codes are provided in the current study. (C) 2018 Elsevier Ltd. All rights reserved.