Sold out but wanted!
More about the book
Addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequality constraints. Provided are 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. 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.
Book purchase
Linear Programming and Network Flows, Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali
- Language
- Released
- 1990
- Binding
- (Hardcover)
We’ll email you as soon as we track it down.
Payment methods
No one has rated yet.
- Title
- Linear Programming and Network Flows
- Subtitle
- Second Edition
- Language
- English
- Publisher
- WILEY
- Released
- 1990
- Format
- Hardcover
- Pages
- 704
- ISBN10
- 0471636819
- ISBN13
- 9780471636816
- Series
- Categories
- Tags
- Description
- Addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequality constraints. Provided are 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. 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.