A counterexample to Greenberg's algorithm for solving linear inequalities

DOI10.1007/BF01399610zbMath0358.65059OpenAlexW2061327062WikidataQ124805978 ScholiaQ124805978MaRDI QIDQ1238400

B. F. Sherman

Publication date: 1977

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

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (2)

A general algorithm for determining all essential solutions and inequalities for any convex polyhedron ⋮ Eliminating extraneous edges in Greenberg's algorithm

Cites Work

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

This page was built for publication: A counterexample to Greenberg's algorithm for solving linear inequalities