Mathematical Programming

AY2018/2019 Semester 1

Unconstrained optimization: one-dimensional search, gradient method, Newton-Raphson method. Constrained optimization: feasible direction methods, penalty/barrier function methods, modern interior point methods for convex programming. Discrete optimization: formulations, cutting plane methods, branch-and-bound methods, Lagrangian relaxation, dynamic programming approach.