Mathematical Programming I

Catalog description

The simplex method. Duality theory and related methods. The revised simplex method, decomposition, and partitioning methods for large structural problems. Network flow problems: max-flow, min-cut theorem, special algorithms for transportation, shortest route, and assignment problems. Aspects of computer implementation.