Mathematical and computational aspects of linear programming and combinatorial optimization. Linear optimization is introduced by presenting solutions techniques (primal and dual simplex) and studying geometric properties and duality for linear systems of inequalities. Basics of combinatorial optimization, including trees, paths, flows, matchings, and matroids, and the corresponding algorithms are presented. (Same as STA 515.)
Text: Combinatorial Optimization: Theory and Algorithms, B. Korte and J. Vygen, Algorithms and Combinatorics 21, Springer, 2002. ISBN: 3-540-43154-3.
Prerequisite: A course in linear algebra or consent of instructor.