CSc I6100 Mathematical Programming I

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.

Credits

3

Prerequisite

CSC 22000 or CSc I0600, and MATH 34600 or equivalent.

Contact Hours

3 hr./wk.