Épuisé, mais très demandé!
En savoir plus sur le livre
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.
Achat du livre
Linear Programming and Network Flows, Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali
- Langue
- Année de publication
- 1990
- Reliure
- (rigide)
Nous vous informerons par e-mail dès que nous l’aurons retrouvé.
Modes de paiement
Personne n'a encore évalué .
- Titre
- Linear Programming and Network Flows
- Sous-titre
- Second Edition
- Langue
- Anglais
- Éditeur
- WILEY
- Publié
- 1990
- Format
- rigide
- Pages
- 704
- ISBN10
- 0471636819
- ISBN13
- 9780471636816
- Séries
- Catégories
- Mots clés
- 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.