Linear programming

Chandru, V and Rao, M R (2010) Linear programming. In: Algorithms and theory of computation handbook. Chapman & Hall/CRC, p. 30.

Full text not available from this repository. (Request a copy)


Linear programming has been a fundamental topic in the development of computational sciences. The subject has its origins in the early work of L. B. J. Fourier on solving systems of linear inequalities, dating back to the 1820s. More recently, a healthy competition between the simplex and interior point methods has led to rapid improvements in the technologies of linear programming. This combined with remarkable advances in computing hardware and software have brought linear programming tools to the desktop, in a variety of application software for decision support. Linear programming has provided a fertile ground for the development of various algorithmic paradigms. Diverse topics such as symbolic computation, numerical analysis, computational complexity, computational geometry, combinatorial optimization, and randomized algorithms all have some linear programming connection. This chapter reviews this universal role played by linear programming in the science of algorithms.

Affiliation: Indian School of Business
ISB Creiators:
ISB Creators
Rao, M R
Item Type: Book Chapter
Uncontrolled Keywords: Linear programming, Algorithms , computational sciences
Subjects: Applied Statistics and Computing
Depositing User: Veeramani R
Date Deposited: 03 Apr 2019 14:38
Last Modified: 03 Apr 2019 14:38
Publisher URL:
Related URLs:

    Actions (login required)

    View Item View Item
    Statistics for DESI ePrint 747 Statistics for this ePrint Item