| Article ID: | iaor200973427 |
| Volume: | 172 |
| Issue: | 1 |
| Start Page Number: | 37 |
| End Page Number: | 43 |
| Publication Date: | Nov 2009 |
| Journal: | Annals of Operations Research |
| Authors: | Soleimani-damaneh M, Zarepisheh M |
| Keywords: | programming: linear |
Imposing additional weight restrictions increases the degeneracy and computational complexity of solving Data Envelopment Analysis (DEA) models, a known class of linear programming models. In this paper some linear transformations to reduce these problems are provided.