This course provides a rigorous treatment of linear and integer optimization. It is designed for students who want to build large-scale optimization models and need an understanding of the underlying theory. The course will cover polyhedral theory, projection and inverse projection techniques for systems of linear inequalities, simplex and interior point algorithms, duality, decomposition techniques, and cutting planes. While this course is theoretical in nature, we will continually illustrate application of the theory to solving real, large-scale problems.

Valid XHTML 1.0! Valid CSS! This Web site validates as strict XHTML 1.0 and CSS.