The Probability that a Random Polytope is Bounded

DOI10.1287/MOOR.2.3.292MaRDI QIDQ4173903zbMATH OpenOpenAlexFDO

Authors Brian K. Schmidt, T. H. Mattheiss

Publication date 1977

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.2.3.292

zbMATH Keywords

Probability of Bounded Random Polytopes

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Geometric probability and stochastic geometry (60D05)

Cited in

(12)

• A computational study of redundancy in randomly generated polytopes
• An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
• Generating a random collection of discrete joint probability distributions subject to partial information
• Approximating joint probability distributions given partial information
• Replica approach to mean-variance portfolio optimization
• Randomly generated polytopes for testing mathematical programming algorithms
• Computational results on an algorithm for finding all vertices of a polytope
• The Average number of pivot steps required by the Simplex-Method is polynomial
• Random polytopes: Their definition, generation and aggregate properties
• The expected number of extreme points of a random linear program
• Expected Number of Vertices of a Random Convex Polyhedron
• Doubly random polytopes

This page was built for publication: The Probability that a Random Polytope is Bounded

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4173903)