Skip to main content
SpringerLink
Log in
Book cover

Handbook of Mathematics pp 636–672Cite as

Linear optimization

  • Chapter

  • 426 Accesses

Abstract

By linear optimization (previously also described as linear programming) one understands the determination of the minimum or maximum of a linear function of finitely many variables that are subject to finitely many conditions. These so-called constraints have the form of linear equations or linear inequalities.

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   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. E. M. L. Beale, Mathematical programming in practice, Pitman, London, 1968.

    Google Scholar 

  2. S. I. Gass, Linear programming. Methods and applications, 4th ed., McGraw-Hill, New York-London, 1975.

    MATH  Google Scholar 

  3. A. J. Jones, Game theory: Mathematical models of conflict, Wiley, New York-London, 1980.

    MATH  Google Scholar 

  4. A. Kaufmann, Graphs, dynamic programming, and finite games, (translated from the French), Academic Press, New York-London, 1967.

    Google Scholar 

  5. B. Kolman and R. E. Beck, Elementary linear programming with applications, Academic Press, New York-London, 1980.

    MATH  Google Scholar 

  6. K. G. Murty, Linear and combinatorial programming, Wiley, New York-London, 1976.

    MATH  Google Scholar 

  7. R. J. Rothenberg, Linear programming, North Holland, Amsterdam-New York, 1979.

    Google Scholar 

  8. J. F. Shapiro, Mathematical programming: Structures and algorithms, Wiley, New York-London, 1970.

    Google Scholar 

  9. G. E. Thompson, Linear programming. An elementary introduction, Macmillan, New York-London, 1971.

    Google Scholar 

  10. N. N. Vorob’ev, Game theory. Lectures for economists and systems scientists, (translated from the Russian), Springer-Verlag, Heidelberg-New York-Berlin, 1977.

    MATH  Google Scholar 

Download references

Authors
  1. I. N. Bronshtein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. A. Semendyayev
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bronshtein, I.N., Semendyayev, K.A. (1998). Linear optimization. In: Handbook of Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21982-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21982-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-21984-3

  • Online ISBN: 978-3-662-21982-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation