The Probability that a Random Polytope is Bounded
From MaRDI portal
Publication:4173903
DOI10.1287/moor.2.3.292zbMath0392.52010OpenAlexW2026456003MaRDI QIDQ4173903
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
Related Items
Doubly random polytopes, Approximating Joint Probability Distributions Given Partial Information, Replica approach to mean-variance portfolio optimization, A computational study of redundancy in randomly generated polytopes, Computational results on an algorithm for finding all vertices of a polytope, Generating a random collection of discrete joint probability distributions subject to partial information, The expected number of extreme points of a random linear program, Expected Number of Vertices of a Random Convex Polyhedron, Randomly generated polytopes for testing mathematical programming algorithms, An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex, The Average number of pivot steps required by the Simplex-Method is polynomial, Random polytopes: Their definition, generation and aggregate properties