Bounds on the number of vertices of perturbed polyhedra

DOI10.1007/BF02023098zbMath0786.90034OpenAlexW2115903355MaRDI QIDQ1312764

Paul Armand

Publication date: 5 May 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

perturbationpolyhedronconvex polytopesdegenerate vertexincident edges

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05)

Related Items (5)

How good are convex hull algorithms? ⋮ A reverse search algorithm for the neighborhood problem ⋮ Selected bibliography on degeneracy ⋮ Degeneracy graphs: Theory and applications. An updated survey ⋮ An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex

Cites Work

• On the structure of the set bases of a degenerate point
• Degeneracy graphs and the neighbourhood problem
• Survey of solved and open problems in the degeneracy phenomenon
• On the solution of highly degenerate linear programmes
• Polytope pairs and their relationship to linear programming
• Determination of the efficient set in multiobjective linear programming
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• The Complexity of Vertex Enumeration Methods
• Faces of a polyhedron
• An Upper Bound Theorem for Polytope Pairs
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• Computational results on an algorithm for finding all vertices of a polytope
• A Technique for Resolving Degeneracy in Linear Programming
• How to Solve Linear Inequalities
• State Constraints in Convex Control Problems of Bolza
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Optimality and Degeneracy in Linear Programming

This page was built for publication: Bounds on the number of vertices of perturbed polyhedra