Expected Number of Vertices of a Random Convex Polyhedron

DOI10.1137/0602047zbMath0504.52004OpenAlexW2040284760MaRDI QIDQ4741323

Douglas G. Kelly, Jon W. Tolle

Publication date: 1981

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0602047

zbMATH Keywords

random polyhedrabehaviour of pivot algorithms for linear programmingexpected value for the number of vertices

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Linear programming (90C05) Polyhedra and polytopes; regular figures, division of spaces (51M20) Polytopes and polyhedra (52Bxx)

Related Items (3)

A branch and bound algorithm for extreme point mathematical programming problems ⋮ On the Number of Vertices of Random Polyhedra with a Given Number of Facets ⋮ Doubly random polytopes

Cites Work

• Polytope pairs and their relationship to linear programming
• On the number of vertices of random convex polyhedra
• The Probability that a Random Polytope is Bounded
• ZufÄllige konvexe Polygone in einem Ringgebiet
• Some results in probabilistic geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Expected Number of Vertices of a Random Convex Polyhedron