Chapter 6 On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method

A novel approach for solving the DEA linear programming problems using a primaldual interior-point method is presented. The solution found by this method satisfies the Strong Complementarity Slackness Condition (SCSC) and maximizes the product of the positive components among all SCSC solutions. The first property is critical in the use of DEA and the second one contributes significantly to the reliability of the solution.

[1]  G. Sonnevend.  An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .

[2]  William W. Cooper,et al.  DEA and stochastic frontier analyses of the 1978 Chinese economic reforms , 1995 .

[3]  Russell G. Thompson,et al.  The role of multiplier bounds in efficiency analysis with application to Kansas farming , 1990 .

[4]  Roy E. Marsten,et al.  The interior-point method for linear programming , 1992, IEEE Software.

[5]  N. Megiddo.  Pathways to the optimal set in linear programming , 1989 .

[6]  Roy E. Marsten,et al.  On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming , 1992, SIAM J. Optim..

[7]  Abraham Charnes,et al.  Preface to topics in data envelopment analysis , 1984, Ann. Oper. Res..

[8]  Yin Zhang,et al.  A Study of Indicators for Identifying Zero Variables in Interior-Point Methods , 1994, SIAM Rev..

[9]  Clóvis C. Gonzaga,et al.  Path-Following Methods for Linear Programming , 1992, SIAM Rev..

[10]  A. Charnes,et al.  A structure for classifying and characterizing efficiency and inefficiency in Data Envelopment Analysis , 1991 .

[11]  Richard A. Tapia,et al.  Effective computation of the analytic center of the solution set in linear programming using primal-dual interior-point methods , 1995 .

[12]  Russell G. Thompson,et al.  Sensitivity Analysis of Efficiency Measures with Applications to Kansas Farming and Illinois Coal Mining , 1994 .

[13]  Richard A. Tapia,et al.  On the Convergence of Interior-Point Methods to the Center of the Solution Set in Linear Programming , 1991 .

[14]  A. Charnes,et al.  Classifying and characterizing efficiencies and inefficiencies in data development analysis , 1986 .

[15]  Russell G. Thompson,et al.  Chapter 7 DEA multiplier analytic center sensitivity with an illustrative application to independent oil companies , 1996, Ann. Oper. Res..

[16]  L. McLinden.  An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem. , 1980 .

[17]  A. J. Goldman,et al.  4. Theory of Linear Programming , 1957 .