New modification of the double description method for constructing the skeleton of a polyhedral cone
From MaRDI portal
Publication:2901170
DOI10.1134/S0965542512010162zbMath1249.52017MaRDI QIDQ2901170
No author found.
Publication date: 16 July 2012
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Convex programming (90C25) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Related Items (13)
Efficient constraint/generator removal from double description of polyhedra ⋮ How to find the convex hull of all integer points in a polyhedron? ⋮ Design of continuous twisting algorithm ⋮ Dynamic flux balance analysis with nonlinear objective function ⋮ Efficient Elimination of Redundancies in Polyhedra by Raytracing ⋮ Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen–Specker theorem: the Peres–Mermin square ⋮ PPLite: zero-overhead encoding of NNC polyhedra ⋮ Construction of a smooth Lyapunov function for the robust and exact second-order differentiator ⋮ Numerical Integration of Discontinuous Functions in Many Dimensions ⋮ Two variations of graph test in double description method ⋮ Inner approximation algorithm for solving linear multiobjective optimization problems ⋮ Accelerating Fourier–Motzkin elimination using bit pattern trees ⋮ Fast method for verifying Chernikov rules in Fourier-Motzkin elimination
This page was built for publication: New modification of the double description method for constructing the skeleton of a polyhedral cone
