Parallel and hierarchical decomposition approaches for solving large-scale Data Envelopment Analysis models

Richard Barr and Matthew Durchholz

Annals of Operations Research, 1997, vol. 73, issue 0, 339-372

Abstract: Accompanying the increasing popularity of DEA are computationally challenging applications: large-scale problems involving the solution of thousands of linear programs. This paper describes a new problem decomposition procedure which dramatically expedites the solution of these computationally intense problems and fully exploits parallel processing environments. Testing of a new DEA code based on this approach is reported for a wide range of problems, including the largest reported to date: an 8,700-LP banking-industry application. Copyright Kluwer Academic Publishers 1997

Keywords: parallel computing; Data Envelopment Analysis; decomposition; mathematical programming (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018941531019 (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:73:y:1997:i:0:p:339-372:10.1023/a:1018941531019

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

DOI: 10.1023/A:1018941531019

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 ().