Miláček čtenářů je právě vyprodaný
Více o knize
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.
Nákup knihy
Linear Programming and Network Flows, Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali
- Jazyk
- Rok vydání
- 1990
- Vazba
- (pevná)
Jakmile se objeví, pošleme e-mail.
Nikdo zatím neohodnotil.
- Titul
- Linear Programming and Network Flows
- Podtitul
- Second Edition
- Jazyk
- anglicky
- Vydavatel
- WILEY
- Rok vydání
- 1990
- Vazba
- pevná
- Počet stran
- 704
- ISBN10
- 0471636819
- ISBN13
- 9780471636816
- Série
- Kategorie
- Štítky
- Anotace
- 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.