An algorithm for determining redundant inequalities and all solutions to convex polyhedra
type: Item
instance of: scholarly article
title: An algorithm for determining redundant inequalities and all solutions to convex polyhedra
zbMATH Open document ID: 0288.65041
DOI: 10.1007/BF01437214
author: Harold Greenberg
published in: Numerische Mathematik
publication date: 1975-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/132322
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3453056
MaRDI profile type: Publication
cites work: An Algorithm for Finding All Vertices of Convex Polyhedral Sets
cites work: An Algorithm for Convex Polytopes
cites work: Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
cites work: Finding all vertices of a convex polyhedron
cites work: An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
cites work: Q5817530
cites work: Q5817857
cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points
cites work: Q5534682
cites work: A Geometric Theory of Solution of Linear Inequalities
cites work: Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
cites work: Q3266142
cites work: Elementare Theorie der konvexen Polyeder
description: scientific article; zbMATH DE number 3453056