Linear transformations to decrease computational requirements of solving some known linear programming models

M. Soleimani-damaneh () and M. Zarepisheh

Annals of Operations Research, 2009, vol. 172, issue 1, 37-43

Abstract: 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. Copyright Springer Science+Business Media, LLC 2009

Keywords: Linear programming; Duality; Degeneracy; DEA; Weights restrictions (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-008-0473-4 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:172:y:2009:i:1:p:37-43:10.1007/s10479-008-0473-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-008-0473-4

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().