Current location Call number Status Date due Barcode
CMI
Salle R
90 DAN (Browse shelf) 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 for this item.

Log in to your account to post a comment.