摘要
Accompanying the increasing popularity of DEA are computationally challenging applications:large-scale problems involving the solution of thousands of linear programs. Thispaper describes a new problem decomposition procedure which dramatically expedites thesolution of these computationally intense problems and fully exploits parallel processingenvironments. Testing of a new DEA code based on this approach is reported for a widerange of problems, including the largest reported to date: an 8,700-LP banking-industryapplication.