Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron

References

• Akhavein J. D., Berger A. N., Berger D. B. The effects of megamergers on efficiency and prices: Evidence from a bank profit function. Rev. Indust. Organ. (1997) 12:95–139Crossref, Google Scholar
• Application Development ToolsIMSL Stat Library (1994) (Visual Numerics, Inc., Houston, TX) Google Scholar
• Barnett V. The ordering of multivariate data. J. Roy. Statist. Soc. A (1976) 139(Part 3):318–344Crossref, Google Scholar
• Berger A. N., Mester L. J. Inside the black box: What explains differences in the efficiencies of financial institutions. J. Banking Finance (1997) 21:895–947Crossref, Google Scholar
• Berger A. N., Hancock D., Humphrey D. B. Bank efficiency derived from the profit function. J. Banking Finance (1993) 17:317–347Crossref, Google Scholar
• Chan T. M. Output-sensitive results on convex hulls, extreme points, and related problems. Discrete Comput. Geometry (1996) 16:369–387Crossref, Google Scholar
• Clarkson K. L. More output-sensitive geometric algorithms. Proc. 35th IEEE Sympos. Foundations Comput. Sci. (1994) Santa Fe, NM:695–702Crossref, Google Scholar
• Dulá J. H. Geometry of optimal value functions with applications to redundancy in linear programming. J. Optim. Theory Appl. (1994) 81:35–52Crossref, 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:352–367Crossref, Google Scholar
• Dulá J. H., Thrall R. M. A computational framework for accelerating DEA. J. Productivity Anal. (2001) 16: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, 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. (1997) 10:323–330Link, Google Scholar
• Edelsbrunner H. Algorithms in combinatorial geometry. Monographs in Theoretical Computer Science (1987) Vol. 10(Springer-Verlag, New York) Crossref, Google Scholar
• Federal Financial Institutions Examination Council2004 Report of Condition and Income (2004) . www.chicagofed.org/economic_research_and_data/commercial_bank_data.cfm Retrieval date: February 6, 2004Google Scholar
• Fukuda K. Frequently asked questions in polyhedral computation. (2004) . http://www.cs.mcgill.ca/∼fukuda/soft/polyfaq/ Retrieval date: June 18, 2004Google Scholar
• Gerstenhaber M., Koopmans T. C. Theory of convex polyhedral cones. Activity Analysis of Production and Allocation (1951) (Chapman and Hall, London, UK) 298–316Google Scholar
• Graham R., Yao F. A whirlwind tour of computational geometry. Amer. Math. Monthly (1990) 97:687–701Crossref, Google Scholar
• López F. J. Algorithms to obtain the frame of a finitely generated unbounded polyhedron. (1999) . Unpublished doctoral dissertation, School of Business Administration, University of Mississippi, University, MSGoogle Scholar
• Mattheiss T. H., Rubin D. S. A survey and comparison of methods for finding all vertices of convex polyhedral sets. Math. Oper. Res. (1980) 5:167–185Link, Google Scholar
• Ottmann T., Schuierer S., Soundaralakshimi S. Enumerating extreme points in higher dimension. Proc. 12th Annual Sympos. Theoret. Aspects Comput. Sci., LNCS (1995) 900(Springer, Berlin, Germany) 562–570Crossref, Google Scholar
• Ottmann T., Schuierer S., Soundaralakshimi S. Enumerating extreme points in higher dimension. Nordic J. Comput. (2001) 8:179–192Google Scholar
• Preparata F. P., Shamos M. I.Computational Geometry: An Introduction (1985) (Springer-Verlag, New York) Crossref, Google Scholar
• Reay J. R. Generalizations of a theorem of Carathéodory. Memoirs Amer. Math. Soc. (1965) 54:1–50Google Scholar
• Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Rosen J. B., Xue G. L., Phillips A. T., Pardalos P. M. Efficient computation of extreme points of convex hulls in ℜd. Advances in Optimization and Parallel Computing (1992) (North Holland, Amsterdam, The Netherlands) 267–292Google Scholar
• Wallace S. W., Wets R. J.-B. Preprocessing in stochastic programming: The case of linear programs. ORSA J. Comput. (1992) 4:45–59Link, Google Scholar
• Wets R. J.-B., Witzgall C. Algorithms for frames and lineality spaces of cones. J. Res. National Bureau Standards Sect. B. Math. Math. Phys. (1967) 71B:1–7Crossref, Google Scholar