Skip to main content

Part of the book series: Applied Optimization ((APOP,volume 80))

  • 1036 Accesses

Abstract

Linear programming (LP) problems involve a linear objective function and linear constraints, as shown below in Example 2.1

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Arbel A. (1993), Exploring Interior-Point Linear Programming Algorithms and Software, MIT Press, Cambridge, MA.

    MATH  Google Scholar 

  2. Carter M. W. and C. C. Price (2001), Operations Research: A Practical Introduction, CRC Press, New York, NY.

    Google Scholar 

  3. Dantzig G. B.(1963), Linear Programming and Extensions, Princeton University Press, NJ.

    MATH  Google Scholar 

  4. Dantzig G. B. and Thapa M. N. (1996), Linear Programming, SpringerVerlag, New York.

    Google Scholar 

  5. Emmett A. (1985), Karmarkar’s algorithm: a threat to simplex, IEEE Spectrum, December, 54.

    Google Scholar 

  6. Fiacco A. V. and McCormick G. P. (1968), Nonlinear Programming: Sequential Unconstrained Minimization, John Wiley and Sons, New York, NY (reprinted by SIAM Publications, 1990).

    MATH  Google Scholar 

  7. Narayan, V., Diwekar U.M. and Hoza M. (1996), Synthesizing optimal waste blends, Industrial and Engineering Chemistry Research, 35, 3519.

    Article  Google Scholar 

  8. Nocedal J. and S. Wright (1999), Numerical Optimization, Springer Series in Oerations Research, Springer-Verlag, New York, NY.

    Book  MATH  Google Scholar 

  9. Taha H. A. (1997), Operations Research: An Introduction, Sixth Edition, Prentice Hall , Upper Saddle River, NJ.

    MATH  Google Scholar 

  10. Winston W. L. (1991), Operations Research: Applications and Algorithms, Second Edition, PWS-KENT Co., Boston, MA.

    MATH  Google Scholar 

  11. Wright S. J. (1997), Primal-Dual Interior-Point Methods, SIAM Publications, Philadelphia, PA.

    Book  MATH  Google Scholar 

  12. Wright S. J. (1999), Algorithms and software for linear and nonlinear programming, Foundations of Computer Aided Process’99, Paper I07, CACHE Corporation, AIChE, New York, NY.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media New York

About this chapter

Cite this chapter

Diwekar, U.M. (2003). Linear Programming. In: Introduction to Applied Optimization. Applied Optimization, vol 80. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3745-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3745-5_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4757-3747-9

  • Online ISBN: 978-1-4757-3745-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics