An algorithm for determining redundant inequalities and all solutions to convex polyhedra (Q1846732): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Algorithm for Finding All Vertices of Convex Polyhedral Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all vertices of a convex polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5534682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Theory of Solution of Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementare Theorie der konvexen Polyeder / rank
 
Normal rank

Latest revision as of 15:18, 12 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for determining redundant inequalities and all solutions to convex polyhedra
scientific article

    Statements