Skip to main content
SpringerLink
Log in

Fast method for verifying Chernikov rules in Fourier-Motzkin elimination

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  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 

  4. S. N. Chernikov, “The convolution of finite systems of linear inequalities,” USSR Comput. Math. Math. Phys. 5(1), 1–24 (1965).

    Article  MATH  MathSciNet  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 

  6. K. Fukuda and A. Prodon, “Double description method revisited,” Combinatorics and Computer Science (Springer-Verlag, New York, 1996), pp. 91–111.

    Chapter  Google Scholar 

  7. N. Yu. Zolotykh, “New modification of the double description method for constructing the skeleton of a polyhedral cone,” Comput. Math. Math. Phys. 51(1), 146–156 (2012).

    Article  MathSciNet  Google Scholar 

  8. A. M. Lukatskii and D. V. Shapot, “A constructive algorithm for folding large-scale systems of linear inequalities,” Comput. Math. Math. Phys. 48(7), 1100–1112 (2008).

    Article  MathSciNet  Google Scholar 

  9. M. M. Deza and M. Laurent, Geometry of Cuts and Metrics (Springer-Verlag, Berlin, 1997; MTsNMO, Moscow, 2001).

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Nizhni Novgorod State University, pr. Gagarina 23, Nizhni Novgorod, 603950, Russia

    S. I. Bastrakov & N. Yu. Zolotykh

Authors
  1. S. I. Bastrakov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Yu. Zolotykh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. I. Bastrakov.

Additional information

Original Russian Text © S.I. Bastrakov, N.Yu. Zolotykh, 2015, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2015, Vol. 55, No. 1, pp. 165–172.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bastrakov, S.I., Zolotykh, N.Y. Fast method for verifying Chernikov rules in Fourier-Motzkin elimination. Comput. Math. and Math. Phys. 55, 160–167 (2015). https://doi.org/10.1134/S0965542515010042

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0965542515010042

Keywords

Search

Navigation