Random polytopes: Their definition, generation and aggregate properties

DOI10.1007/BF01585093zbMath0491.90060OpenAlexW2014935114MaRDI QIDQ3953557

Robert L. Smith, Jerrold H. May

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585093

zbMATH Keywords

Monte Carlo methodrandom polytopeproblem generationaggregate polytope propertiesexpected number of extreme points

Mathematics Subject Classification ID

Linear programming (90C05) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Polytopes and polyhedra (52Bxx)

Related Items (14)

An optimal algorithm for realizing a Delaunay triangulation ⋮ Random linear programs with many variables and few constraints ⋮ A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps ⋮ Random projections for quadratic programs ⋮ Weighted Poisson cells as models for random convex~polytopes ⋮ A computational study of redundancy in randomly generated polytopes ⋮ On the average number of steps of the simplex method of linear programming ⋮ Intrinsic volumes of symmetric cones and applications in convex programming ⋮ On the asymptotic average number of efficient vertices in multiple objective linear programming ⋮ Uniform distributions in a class of convex polyhedrons with applications to drug combination studies ⋮ Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems ⋮ The expected number of extreme points of a random linear program ⋮ Randomly generated polytopes for testing mathematical programming algorithms ⋮ Random polytopes: Their definition, generation and aggregate properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomly generated polytopes for testing mathematical programming algorithms
• Computational results on an algorithm for finding all vertices of a polytope
• Random polytopes: Their definition, generation and aggregate properties
• On generation of test problems for linear programming codes
• Technical Note—Statistical Measures for Linear Functions on Polytopes
• The Probability that a Random Polytope is Bounded
• The convex hull of a random set of points
• Geometrical Probability and Random Points on a Hypersphere
• Convex Analysis
• [https://portal.mardi4nfdi.de/wiki/Publication:5588965 Die konvexe H�lle von n rotationssymmetrisch verteilten Punkten]
• How to Solve Linear Inequalities
• The maximum numbers of faces of a convex polytope
• Some Empirical Tests of the Criss-Cross Method
• [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]
• RANDOM POLYGONS DETERMINED BY RANDOM LINES IN A PLANE
• Partition of Space

This page was built for publication: Random polytopes: Their definition, generation and aggregate properties