IE 613 Large Scale Programming
Credit Information:
(3+0+0) 3
Description:
Decomposition, partitioning and compact inverse methods to deal with large and sparse optimization. Special structures such as Leontief substitution systems, production-inventory models. Simplex method with upper bounds and generalized upper bounding. Constraint relaxation methods. Branch and bound and Bender's partitioning methods to solve mixed integer linear programs.
Prerequisite:
IE 501 or instructor's consent.
Syllabus:
