Courses

Theory and geometry of linear programming. The simplex method. Duality theory, sensitivity analysis, column generation and decomposition. Interior point methods. Introduction to nonlinear optimization: convexity, optimality conditions, steepest descent, and Newton’s method, active set, and barrier methods.