On the dynamic problem of computing generators of a polyhedral cone

DOI10.14529/MMPH170101zbMATH Open1398.65075OpenAlexW2618586707MaRDI QIDQ5374529FDOQ5374529

Authors: Sergei I. Bastrakov, N. Yu. Zolotykh 

Publication date: 14 September 2018

Published in: Bulletin of the South Ural State University series "Mathematics. Mechanics. Physics" (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14529/mmph170101

Recommendations

• A dynamic algorithm for constructing the dual representation of a polyhedral cone
• Efficient constraint/generator removal from double description of polyhedra
• Efficient elimination of redundancies in polyhedra by raytracing
• scientific article; zbMATH DE number 3918105
• Two variations of graph test in double description method

zbMATH Keywords

system of linear inequalitiespolyhedral conedouble description methodcomputing dual description

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Dynamic programming (90C39) Linear inequalities of matrices (15A39)

Cited In (5)

• Two variations of graph test in double description method
• Efficient constraint/generator removal from double description of polyhedra
• A dynamic algorithm for constructing the dual representation of a polyhedral cone
• A Matrix Approach to Finding a Set of Generators and Finding the Polar (Dual) of a Class of Polyhedral Cones
• Algorithm for recalculating the generatrix lines of a finitely generated fuzzy cone after adding a generatrix to its dual cone

This page was built for publication: On the dynamic problem of computing generators of a polyhedral cone

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