The convolution of finite systems of linear inequalities

DOI10.1016/0041-5553(65)90064-9MaRDI QIDQ5528990zbMATH OpenOpenAlexFDO

Authors S. N. Chernikov

Publication date 1965

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(65)90064-9

zbMATH Keywords

numerical analysis

Cited in

(5)

• Linear inequalities and some of their applications
• Fast method for verifying Chernikov rules in Fourier-Motzkin elimination
• The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
• Accelerating Fourier-Motzkin elimination using bit pattern trees
• Wald, QLR, and score tests when parameters are subject to linear inequality constraints

This page was built for publication: The convolution of finite systems of linear inequalities

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