Linear Programming and Network Flows

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

Linear Programming and Network Flows, now in its third edition, addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequility constraints. This
* Provides methods for modeling complex problems via effective algorithms on modern computers.
* Presents the general theory and characteristics of optimization problems, along with effective solution algorithms.
* Explores linear programming (LP) and network flows, employing polynomial-time algorithms and various specializations of the simplex method.

Genres: Mathematics, Textbooks, Computer Science

744 pages, Hardcover

First published January 1, 1977

Reviews

[Maharani Rizki]

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]

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

[Ozra_sargarm]

a

[Milad]

Simple and neat. :)

[Dany HUAMANÑAHUI]

I thinking in read