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

Abstract 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.