论文信息 - The Probability that a Random Polytope is Bounded

The Probability that a Random Polytope is Bounded

A formula for the probability that a randomly generated n-polytope defined by m half-spaces is bounded is presented. Results of a simulation giving i the probability that all m constraints are relevant and ii a formula for the expected number of vertices of a polytope, are presented.

Brian K. Schmidt | T. H. Mattheiss

[1] D. R. Fulkerson,et al. Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[2] Egon Balas,et al. Integer programming and convex analysis: Intersection cuts from outer polars , 1972, Math. Program..

[3] Aydin Ulkucu. Efficiency Measures of Vertex Following Algorithms on Polyhedral Sets. , 1975 .

[4] T. H. Mattheiss,et al. An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities , 1973, Oper. Res..

[5] R. Winder. Partitions of N-Space by Hyperplanes , 1966 .

[6] D. Barnette. The minimum number of vertices of a simple polytope , 1971 .

[7] Richard H. Shachtman. Generation of the Admissible Boundary of a Convex Polytope , 1974, Oper. Res..