| Article ID: | iaor201110457 |
| Volume: | 217 |
| Issue: | 1 |
| Start Page Number: | 173 |
| End Page Number: | 184 |
| Publication Date: | Feb 2012 |
| Journal: | European Journal of Operational Research |
| Authors: | Tanino Tetsuzo, Tanaka Tamaki, Yamada Syuuji, Washio Satoshi |
| Keywords: | programming: quadratic |
In this paper, we suggest four types of improvements for making inefficient DMUs efficient in the CCR model with the minimal change of input and output values. Moreover, we propose an algorithm for calculating such improvements by applying quadratic programming techniques. Furthermore, since all equations constructing the efficient frontiers of the CCR and BCC models are necessary to execute the algorithm, we present a procedure for calculating them.