THE LINEAR PROGRAMMING APPROACH ON A-P SUPER-EFFICIENCY DATA ENVELOPMENT ANALYSIS MODEL OF INFEASIBILITY OF SOLVING MODEL
Chiao-Ping Bao, Chen-Hu Jeng, Ching-Chung Guey and Chien-Liang Lin
DOI : 10.3844/ajassp.2014.601.605
American Journal of Applied Sciences
Volume 11, Issue 4
The traditional CCR or BCC model in DEA for DMU assessment often come out with multiple efficiency units, which cause problems in rank ordering. Therefore, we intended to improve level of discrimination among Decision Making Units (DMUs). The present study thus seeks to solve the above-mentioned problems of discrimination and infeasible solutions in A-P super-efficient mode by proposing a feasible linear programming approach. In addition, for the nonlinear problem, using (1-α)/(1+ β), in the objective function and constrains of the general model when applying SE in DEA, an improved linear programming solution mode is proposed, along with the assessment model of dominated decision making units to solve the problem of infeasible solution. Through the results of proof and calculation on the data in the given example, the present study proposes linear programming solution mode suitable for input-oriented, output-oriented and non-oriented model, respectively and such a linear programming solution model can substantially improve and solve the above mentioned problems of discrimination and infeasible solutions.
© 2014 Chiao-Ping Bao, Chen-Hu Jeng, Ching-Chung Guey and Chien-Liang Lin. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.