An Algorithm for Data Envelopment Analysis

References

• Ali A. I. Streamlined computation for data envelopment analysis. Eur. J. Oper. Res. (1993) 64(1):61–67Crossref, Google Scholar
• Barr R. S., Durchholz M. L. Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models. Ann. Oper. Res. (1997) 73:339–372Crossref, Google Scholar
• Berger A. N., Hancock D., Humphrey D. B. Bank efficiency derived from the profit function. J. Banking Finance (1993) 17(2–3):317–347Crossref, Google Scholar
• Bougnol M.-L., Dulá J. H. Anchor points in DEA. Eur. J. Oper. Res. (2009) 192(2):668–676Crossref, Google Scholar
• Charnes A., Cooper W. W., Rhodes E. Measuring the efficiency of decision making units. Eur. J. Oper. Res. (1978) 2(6):429–444Crossref, Google Scholar
• Charnes A., Cooper W. W., Golany B., Seiford L., Stutz J. Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions. J. Econometrics (1985) 30(1–2):91–107Crossref, Google Scholar
• Clarkson K. L. More output-sensitive geometric algorithms. Proc. 35th IEEE Sympos. Found. Comput. Sci., (FOCS 1994), Santa FE, NM (1994) 695–702Crossref, Google Scholar
• Cooper W. W., Ruiz J. L., Sirvent I. Choosing weights from alternative optimal solutions of dual multiplier models in DEA. Eur. J. Oper. Res. (2007) 180(1):443–458Crossref, Google Scholar
• Dulá J. H. A computational study of DEA with massive data sets. Comput. Oper. Res. (2008) 35(4):1191–1203Crossref, Google Scholar
• Dulá J. H. A geometrical approach for generalizing the production possibility set in DEA. J. Oper. Res. Soc. (2009) 60(11):1546–1555Crossref, Google Scholar
• Dulá J. H., Helgason R. V. A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space. Eur. J. Oper. Res. (1996) 92(2):352–367Crossref, Google Scholar
• Dulá J. H., López F. J. Algorithms for the frame of a finitely generated unbounded polyhedron. INFORMS J. Comput. (2006) 18(1):97–110Link, Google Scholar
• Dulá J. H., López F. J. Preprocessing DEA. Comput. Oper. Res. (2009) 36(4):1204–1220Crossref, Google Scholar
• Dulá J. H., Thrall R. M. A computational framework for accelerating DEA. J. Productivity Anal. (2001) 16(1):63–78Crossref, Google Scholar
• Dulá J. H., Helgason R. V., Hickman B. L., Balci O. Preprocessing schemes and a solution method for the convex hull problem in multidimensional space. Computer Science and Operations Research: New Developments in Their Interfaces (1992) (Pergamon Press, Oxford, UK) 59–70Crossref, Google Scholar
• Dulá J. H., Helgason R. V., Venugopal N. An algorithm for identifying the frame of a pointed finite conical hull. INFORMS J. Comput. (1998) 10(3):323–330Link, Google Scholar
• Federal Financial Institutions Examination Council (FFIEC) Reports of Condition and Income. (2009) . Retrieved August 26, 2010, http://www.chicagofed.org/webpages/banking/financial_institution_reports/commercial_bank_data.cfmGoogle Scholar
• ILOG CPLEX 6.6 User's manual. (2007) . ILOG, Incline Village, NVGoogle Scholar
• Sueyoshi T., Chang Y.-L. Efficient algorithm for additive and multiplicative models in data envelopment analysis. Oper. Res. Lett. (1989) 8(4):205–213Crossref, Google Scholar
• Thanassoulis E., Allen R. Simulating weights restrictions in data envelopment analysis by means of unobserved DMUs. Management Sci. (1998) 44(4):586–594Link, Google Scholar