Computational results on an algorithm for finding all vertices of a polytope

DOI10.1007/BF01588326zbMath0433.90045MaRDI QIDQ3872190

T. H. Mattheiss, Brian K. Schmidt

Publication date: 1980

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

zbMATH Keywords

algorithmlinear programmingpolytopescomputational resultsdetermination of all vertices of a polytope

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Polytopes and polyhedra (52Bxx)

Related Items

Constructing the set of efficient objective values in linear multiple objective transportation problems, Evolution, games theory and polyhedra, Enumerative techniques for solving some nonconvex global optimization problems, A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons, A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program, An improved vertex enumeration algorithm, An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\)., The expected number of extreme points of a random linear program, Bounds on the number of vertices of perturbed polyhedra, Obtaining simultaneous solutions of linear subsystems of inequalities and duals, Random polytopes: Their definition, generation and aggregate properties

Cites Work

• Zufällige konvexe Polyeder im \(n\)-dimensionalen Euklidischen Raum
• Polytope pairs and their relationship to linear programming
• The Probability that a Random Polytope is Bounded
• Some results in probabilistic geometry
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities