Abstract
Consider a finite point set \(\mathcal{A}\) in m-dimensional space and the polyhedral hulls it generates from constrained linear combinations of its elements. There are several interesting management problems that are modelled using these point sets and the resulting polyhedral objects. Examples include efficiency/performance evaluation, ranking and ordering schemes, stochastic scenario generation, mining for the detection of fraud, etc. These applications require the identification of frames; that is, the extreme elements of the polyhedral sets, a computationally intensive task. Traditional approaches require the solution of an LP for each point in the point set. We discuss this approach as well as a new generation of faster, output-sensitive, algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fukuda, K.: Frequently asked questions in polyhedral computation (2000), http://www.cs.mcgill.ca/~fukuda/soft/polyfaq/
Edelsbrunner, H.: Algorithms in combinatorial geometry. In: Monographs in Theoretical Computer Science, vol. 10, Springer, New York (1987)
Rosen, J.B., Xue, G.L., Phillips, A.T.: Efficient computation of extreme points of convex hulls in \(\Re^d\). In: Pardalos, P.M. (ed.) Advances in Optimization and Parallel Computing, pp. 267–292. North Holland, Amsterdam (1992)
Gerstenhaber, M.: Theory of convex polyhedral cones. In: Koopmans, T.C. (ed.) Activity Analysis of Production and Allocation, pp. 298–316. Chapman and Hall, London (1951)
Application Development Tools. In: IMSL Stat Library, Visual Numerics, Inc., Houston (1994)
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. 92, 352–367 (1996)
Clarkson, K.L.: More output-sensitive geometric algorithms. In: Proc. 35th IEEE Sympos. Found. of Comput. Sci., Santa Fe, NM, pp. 695–702 (1996)
Ottmann, T., Schuierer, S., Soundaralakshimi, S.: Enumerating extreme points in higher dimension. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 562–570. Springer, Heidelberg (1995)
Chan, T.M.: Output-sensitive results on convex hulls, extreme points, and related problems. Discrete & Comput. Geometry 16, 369–387 (1996)
Ottmann, T., Schuierer, S., Soundaralakshimi, S.: Enumerating extreme points in higher dimension. Nordic J. Comput. 8, 179–192 (2001)
Dulá, J.H., Helgason, R.V., Venugopal, N.: An algorithm for identifying the frame of a pointed finite conical hull. INFORMS J. Computing 10, 323–330 (1997)
Dulá, J.H., Lopéz, F.J.: Algorithms for the frame of a finitely generated unbounded polyhedron, INFORMS J. Computing (2005) (to appear)
Barnett, V.: The ordering of multivariate data. J. Roy. Statist. Soc. A, 318–344 (1976)
Wallace, S.W., Wets, R.J.B.: Preprocessing in stochastic programming: the case of linear programs. ORSA Journal on Computing 4, 45–59 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dulá, J.H. (2005). Point Sets and Frame Algorithms in Management. In: Megiddo, N., Xu, Y., Zhu, B. (eds) Algorithmic Applications in Management. AAIM 2005. Lecture Notes in Computer Science, vol 3521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496199_48
Download citation
DOI: https://doi.org/10.1007/11496199_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26224-4
Online ISBN: 978-3-540-32440-9
eBook Packages: Computer ScienceComputer Science (R0)