¡Agotado, pero muy deseado!
Más información sobre el libro
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.
Compra de libros
Linear Programming and Network Flows, Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali
- Idioma
- Publicado en
- 1990
- Encuadernación
- (Tapa dura)
Te avisaremos por correo electrónico en cuanto lo localicemos.
Métodos de pago
Nadie lo ha calificado todavía.
- Título
- Linear Programming and Network Flows
- Subtítulo
- Second Edition
- Idioma
- Inglés
- Editorial
- WILEY
- Publicado en
- 1990
- Formato
- Tapa dura
- Páginas
- 704
- ISBN10
- 0471636819
- ISBN13
- 9780471636816
- Serie
- Categorías
- Etiquetas
- Descripción
- 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.