Linear Programming and Network Flows

by Mokhtar S. Bazaraa, Hanif D. Sherali, John J. Jarvis

This work addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequality constraints. It provides methods for modeling complex problems via effective algorithms on modern computers. The general theory and characteristics of optimization problems are presented, along with effective solution algorithms. The text also explores linear programming and network flows, employing polynomial-time algorithms and various specializations of the simplex method. Includes many numerical examples to illustrate theory and techniques.

Genres: Mathematics, Textbooks, Computer Science

704 pages, Hardcover

First published January 1, 1977

Reviews

[Maharani Rizki · Rating 5 out of 5]

This book is by far the best on linear programming. I found it a little bit hard to understand the explanation in the book, but the examples are exceptional. I learn a lot from the example provided.

[Ehsan · Rating 5 out of 5]

Best theoretical book on LP. Not so good for undergrad courses.

[Ozra_sargarm]

a

[Milad · Rating 5 out of 5]

Simple and neat. :)

[Dany HUAMANÑAHUI]

I thinking in read