Mathematics 557 - LinearOptimization & Polytopes

This proof-based course covers the fundamentals of linear optimization and polytopes and the relationship between them. The course will give a rigorous treatment of the algorithms used in linear optimization. The topics covered in linear optimization are graphical methods to find optimal solutions in two and three dimensions, the simplex algorithm, duality and Farkas? lemma, variation of cost functions, an introduction to integer programming and Chvatal-Gomory cuts. The topics covered simultaneously in polytopes are two- and three-dimensional polytopes, f-vectors, equivalence of the vertex and hyperplane descriptions of polytopes, the Hirsch conjecture, the secondary polytope, and an introduction to counting lattice points of polytopes.

MATH 235 & 300 or COMPSCI 250 Note: 27 seats reserved for Math majors
To submit an override request, please visit: https://goo.gl/forms/njwWgVZjhsjWDP1y2