An algorithm for determining redundant inequalities and all solutions to convex polyhedra
- 1 February 1975
- journal article
- Published by Springer Nature in Numerische Mathematik
- Vol. 24 (1), 19-26
- https://doi.org/10.1007/bf01437214
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear InequalitiesOperations Research, 1973
- An Algorithm for Convex PolytopesJournal of the ACM, 1970
- Finding all vertices of a convex polyhedronNumerische Mathematik, 1968
- Solving the Fixed Charge Problem by Ranking the Extreme PointsOperations Research, 1968
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming ProblemsManagement Science, 1966
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalitiesUSSR Computational Mathematics and Mathematical Physics, 1965
- An Algorithm for Finding All Vertices of Convex Polyhedral SetsJournal of the Society for Industrial and Applied Mathematics, 1961
- Elementare Theorie der konvexen PolyederCommentarii Mathematici Helvetici, 1934
- A geometric theory of solution of linear inequalitiesTransactions of the American Mathematical Society, 1931