Eliminating extraneous edges in Greenberg's algorithm

DOI10.1007/BF01581632zbMath0446.90050OpenAlexW1998587811WikidataQ56324211 ScholiaQ56324211MaRDI QIDQ3892062

Martin Dyer, L. G. Proll

Publication date: 1980

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

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

zbMATH Keywords

extreme pointsdegeneracyconvex polyhedroncomputational experiencelinear inequalitieselimination of extraneous solutionsGreenberg's algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39) Inequalities and extremum problems involving convexity in convex geometry (52A40) Iterative numerical methods for linear systems (65F10) Polytopes and polyhedra (52Bxx)

Related Items (1)

A general algorithm for determining all essential solutions and inequalities for any convex polyhedron

Cites Work

• A counterexample to Greenberg's algorithm for solving linear inequalities
• An algorithm for determining redundant inequalities and all solutions to convex polyhedra
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• Unnamed Item

This page was built for publication: Eliminating extraneous edges in Greenberg's algorithm