Fast method for verifying Chernikov rules in Fourier-Motzkin elimination
From MaRDI portal
Publication:2354428
DOI10.1134/S0965542515010042zbMath1318.65021MaRDI QIDQ2354428
Sergei I. Bastrakov, Nikolai Yu. Zolotykh
Publication date: 13 July 2015
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
polyhedronnumerical resultsystem of linear inequalitieselimination of variablesFourier-Motzkin eliminationChernikov rules
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
How to find the convex hull of all integer points in a polyhedron? ⋮ Wald, QLR, and score tests when parameters are subject to linear inequality constraints ⋮ On facet-inducing inequalities for combinatorial polytopes ⋮ Two variations of graph test in double description method ⋮ Accelerating Fourier–Motzkin elimination using bit pattern trees
Cites Work
- Unnamed Item
- Unnamed Item
- New modification of the double description method for constructing the skeleton of a polyhedral cone
- Lectures on Polytopes
- The convolution of finite systems of linear inequalities
- Algebraic theory of linear inequalities
- Geometry of cuts and metrics
- A constructive algorithm for folding large-scale systems of linear inequalities
This page was built for publication: Fast method for verifying Chernikov rules in Fourier-Motzkin elimination
