Linear programming, 2, theory and extensions / George B. Dantzig, Mukund N. Thapa
Type de document : MonographieCollection : Springer series in operations researchLangue : anglais.Pays: Etats Unis.Éditeur : New York : Springer, 2003Description : 1 vol. (xxv-448 p.) : ill. ; 24 cmISBN: 0387986138.Bibliographie : Bibliogr. p. 379-438. Index.Sujet MSC : 90C05, Mathematical programming, Linear programming90C51, Mathematical programming, Interior-point methods
90C46, Mathematical programming, Optimality conditions and duality in mathematical programming
90B06, Operations research and management science, Transportation, logistics and supply chain management
90B10, Operations research and management science, Deterministic network models in operations researchEn-ligne : Springerlink
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Monographie
|
CMI Salle 2 | 90 DAN (Browse shelf(Opens below)) | Available | 02323-01 |
The content of the book is about equally split between Linear Programming theory and extensions. The first six chapters cover essential linear programming material: geometry of the Simplex Method, duality, interior point methods, degeneracy and variants of the simplex algorithm (including dual and primal-dual algorithms as well as parametric linear programming). Chapters 7 to 12 form the “extensions" part of the book and cover special cases of linear programming (the transportation problem and network flow theory), generalized upper bounds, decomposition (Dantzig-Wolfe and Benders) and (two-stage) stochastic programming. An appendix on probability theory is provided as background for Chapter 12. (Zentralblatt)
Bibliogr. p. 379-438. Index
There are no comments on this title.