Eliminating extraneous edges in Greenberg's algorithm

DOI10.1007/BF01581632MaRDI QIDQ3892062zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

computational experienceconvex polyhedrondegeneracyelimination of extraneous solutionsextreme pointsGreenberg's algorithmlinear inequalities

Mathematics Subject Classification ID

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

Cites work

• A counterexample to Greenberg's algorithm for solving linear inequalities
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• An algorithm for determining redundant inequalities and all solutions to convex polyhedra
• scientific article; zbMATH DE number 3078984 (Why is no real title available?)

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3892062)