| Article ID: | iaor2013256 |
| Volume: | 7 |
| Issue: | 1 |
| Start Page Number: | 101 |
| End Page Number: | 115 |
| Publication Date: | Jan 2013 |
| Journal: | Optimization Letters |
| Authors: | Soleimani-damaneh M |
| Keywords: | statistics: data envelopment analysis, programming: dynamic |
This paper provides a recursive enumeration algorithm for solving the nonconvex dynamic DEA models, to obtain cost minimum under nonconvex technologies. The validity of the algorithm is proved through some theorems. An illustrative example as well as a computational discussion are given to demonstrate the advantages of the proposed algorithm.