An algorithm for determining redundant inequalities and all solutions to convex polyhedra

DOI10.1007/BF01437214zbMath0288.65041MaRDI QIDQ1846732

Harold Greenberg

Publication date: 1975

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132322

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (8)

A general algorithm for determining all essential solutions and inequalities for any convex polyhedron ⋮ A state-set estimation algorithm for linear systems in the presence of bounded disturbances ⋮ A complete description of cones and polytopes including hypervolumes of all facets of a polytope ⋮ A method of transferring polyhedron between the intersection-form and the sum-form ⋮ A counterexample to Greenberg's algorithm for solving linear inequalities ⋮ An algorithm for determining all extreme points of a convex polytope ⋮ Eliminating extraneous edges in Greenberg's algorithm ⋮ Enumerating extreme points of a highly degenerate polytope

Cites Work

• Elementare Theorie der konvexen Polyeder
• Finding all vertices of a convex polyhedron
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• A Geometric Theory of Solution of Linear Inequalities
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• An Algorithm for Convex Polytopes
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for determining redundant inequalities and all solutions to convex polyhedra