Course Page

Topics in Mixed Integer Nonlinear Programming

Course Number:

47859


Program

PHD


Concentrations

Operations Research


Course Description

This is a Ph.D. level course that covers special topics in mixed-integer nonlinear programming.  A basic knowledge of global optimization, convex analysis and integer programming is required for the course.  Some of the topics that will be discussed include: Computational complexity of MINLPs, Polynomial optimization, Submodular optimization, Convex relaxations, and Algorithms.

Format

Lecture: 100min/wk and Recitation: 50min/wk


Pre-requisites

None