Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Optimization pp 1074–1077Cite as

Fourier–Motzkin Elimination Method

  • Reference work entry

Article Outline

Keywords

Solution of Systems of Linear Inequalities and Linear Programming Problems

Complexity of the Fourier–Motzkin Method

See also

References

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Avis D, Bremner B, Seidel R (1997) How good are convex hull algorithms. Comput Geom Th Appl 7:265–302

    Article  MathSciNet  MATH  Google Scholar 

  2. Basu S (1997) An improved algorithm for quantifier elimination over real closed fields. In: Proc. 38th IEEE Symp. Foundations of Computer Sci., pp 56–65

    Google Scholar 

  3. Chvátal V (1983) Linear programming. Freeman, New York

    MATH  Google Scholar 

  4. Dantzig GB, Eaves BC (1975) Fourier–Motzkin elimination and its dual. J Combin Th A 14:288–297

    Article  MathSciNet  Google Scholar 

  5. Dines LL (1918/9) Systems of linear inequalities. Ann of Math 2(20):191–199

    MathSciNet  Google Scholar 

  6. Eaves BC, Rothblum UG (1992) Dines–Fourier–Motzkin quantifier-elimination and applications of corresponding transfer principles over ordered fields. Math Program 53:307–321

    Article  MathSciNet  MATH  Google Scholar 

  7. Ferrante J, Rackoff C (1975) A decision procedure for the first order theory of real addition with order. SIAM J Comput 1:69–76

    Article  MathSciNet  Google Scholar 

  8. Fourier JBJ (1973) Analyse de travaux de l'Académie Royale de Sci., pendant l'anné 1824. In: Kohler DA (ed) Oper Res, 10, pp 38–42, Transl. of a Report by Fouries on his work on linear inequalities.

    MathSciNet  Google Scholar 

  9. Fukuda K, Prodon A (1996) Double description method revisited. Lecture Notes Computer Sci 1120:91–111

    MathSciNet  Google Scholar 

  10. Kuhn HW (1956) Solvability and consistency for linear equations and inequalities. Amer Math Monthly 63:217–232

    Article  MathSciNet  MATH  Google Scholar 

  11. McMullen P (1970) The maximal number of faces of a convex polytope. Mathematika 17:179–184

    MathSciNet  MATH  Google Scholar 

  12. Motzkin TS (1936) Beiträge zur Theorie der linearen Ungleichungen. Doktorarbeit, Univ. Basel. Transl. in Cantor D, Gordon B, Rothschild B (eds) (1983): Contribution to the theory of linear inequalities: Selected papers. Birkhäuser, pp 81–103

    Google Scholar 

  13. Motzkin TS, Raifa H, Thompson GL, Thrall RM (1953) The double description method. In: Kuhn HW, Tucker AW (eds) Contributions to the Theory of Games, vol II. Ann Math Stud. 28 Princeton Univ. Press, Princeton, pp 81–103

    Google Scholar 

  14. Schrijver A (1986) Theory of linear and integer programming. Wiley/Interscience, New York

    MATH  Google Scholar 

  15. Ziegler GM (1994) Lectures on polytopes. Springer, Berlin

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Computer Sci., Rutgers University, Piscataway, USA

    Leonid Khachiyan

Authors
  1. Leonid Khachiyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Khachiyan, L. (2008). Fourier–Motzkin Elimination Method . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_187

Download citation

Publish with us

Policies and ethics

Search

Navigation