Skip to main content
  • Textbook
  • © 2007

Understanding and Using Linear Programming

  • Elementary, excellently written textbook on linear programming for a very wide-ranging readership

  • Includes supplementary material: sn.pub/extras

Part of the book series: Universitext (UTX)

Buying options

eBook USD 64.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-30717-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 84.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (9 chapters)

  1. Front Matter

    Pages I-VIII
  2. What Is It, and What For?

    • Jiří Matoušek, Bernd Gärtner
    Pages 1-10
  3. Examples

    • Jiří Matoušek, Bernd Gärtner
    Pages 11-27
  4. Integer Programming and LP Relaxation

    • Jiří Matoušek, Bernd Gärtner
    Pages 29-40
  5. Theory of Linear Programming: First Steps

    • Jiří Matoušek, Bernd Gärtner
    Pages 41-56
  6. The Simplex Method

    • Jiří Matoušek, Bernd Gärtner
    Pages 57-79
  7. Duality of Linear Programming

    • Jiří Matoušek, Bernd Gärtner
    Pages 81-104
  8. Not Only the Simplex Method

    • Jiří Matoušek, Bernd Gärtner
    Pages 105-130
  9. More Applications

    • Jiří Matoušek, Bernd Gärtner
    Pages 131-191
  10. Software and Further Reading

    • Jiří Matoušek, Bernd Gärtner
    Pages 193-193
  11. Back Matter

    Pages 195-226

About this book

This is an introductory textbook of linear programming, written mainly for students of computer science and mathematics. Our guiding phrase is, "what every theoretical computer scientist should know about linear programming". The book is relatively concise, in order to allow the reader to focus on the basic ideas. For a number of topics commonly appearing in thicker books on the subject, we were seriously tempted to add them to the main text, but we decided to present them only very brie?y in a separate glossary. At the same time, we aim at covering the main results with complete proofs and in su?cient detail, in a way ready for presentation in class. One of the main focuses is applications of linear programming, both in practice and in theory. Linear programming has become an extremely ?- ible tool in theoretical computer science and in mathematics. While many of the ?nest modern applications are much too complicated to be included in an introductory text, we hope to communicate some of the ?avor (and excitement) of such applications on simpler examples.

Keywords

  • Computer
  • algorithm
  • computer science
  • linear algebra
  • linear optimization
  • linear programming
  • optimization
  • programming

Reviews

From the reviews:

"The authors’ guiding phrase is ‘what every theoretical computer scientist should know about linear programming’. … this book is easy and pleasant reading. A number of examples and illustrations are provided throughout the book. … The book is well written and well organized; I recommend it to undergraduate students and also to ‘pure mathematicians’ … . I recommend this book to computer scientists and mathematicians willing to learn the fundamentals of linear programming, and some of its many applications." (Fabio Mainardi, MAA Online, February, 2007)

"If you are looking for a concise and well-written overview of linear programming, then this may be the book for you. … The book is appropriate for nontheoretical computer scientists as well … . Matoušek and Gärtner’s Understanding and Using Linear Programming is a well-written introduction to the subject. … an excellent choice for anyone with a working knowledge of linear algebra who wants to learn more about the history and theory of linear programming, as it is written clearly and has a lively spirit." (Nancy C. Weida, SIAM Review, Vol. 49 (4), 2007)

"Focus in this interesting and recommendable textbook is on geometry and duality as well as on different solution algorithms for linear programming problems. The structure of the feasible set is explained and the relations between its vertices and basic feasible solutions are shown. … Both the ellipsoid and the interior point methods can be found in the textbook. The theory is complemented by many examples both from applications and relaxations of integer linear programming problems." (Stephan Dempe, Zentralblatt MATH, Vol. 1133 (11), 2008)

Authors and Affiliations

  • Department of Applied Mathematics, Charles University, Praha 1, Czech Republic

    Jiří Matoušek

  • Institute of Theoretical Computer Science, ETH Zurich, Zurich, Switzerland

    Bernd Gärtner

About the authors



Bibliographic Information

Buying options

eBook USD 64.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-30717-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 84.99
Price excludes VAT (USA)