Fast method for verifying Chernikov rules in Fourier-Motzkin elimination
- 122 Downloads
The problem of eliminating unknowns from a system of linear inequalities is considered. A new fast technique for verifying Chernikov rules in Fourier-Motzkin elimination is proposed, which is an adaptation of the “graph” test for adjacency in the double description method. Numerical results are presented that confirm the effectiveness of this technique.
Keywordssystem of linear inequalities polyhedron elimination of variables Fourier-Motzkin elimination Chernikov rules
Unable to display preview. Download preview PDF.
- 1.S. N. Chernikov, Linear Inequalities (Nauka, Moscow, 1968) [in Russian].Google Scholar
- 2.G. Ziegler, Lectures on Polytopes (Springer New York, 1998).Google Scholar
- 3.S. N. Chernikov, “Convolution of systems of linear inequalities,” Dokl. Akad. Nauk SSSR 131(3), 518–521 (1960).Google Scholar
- 5.T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall, “The double description method,” in Contributions to the Theory of Games, Annals of Mathematics Studies (Princeton Univ. Press, Princeton, New Jersey, 1953), Vol. 28, No. 2, pp. 51–73.Google Scholar