This course blends optimization theory and computation and its teachings can be applied to modern data analytics, economics, and engineering. Organized across four modules, it takes learners through basic concepts, models, and algorithms in linear optimization, convex optimization, and integer optimization.
The first module of the course is a general overview of key concepts in linear algebra, calculus, and optimization. The second module of the course is on linear optimization, covering modeling techniques with many applications, basic polyhedral theory, simplex method, and duality theory. The third module is on convex conic optimization, which is a significant generalization of linear optimization. The fourth and final module focuses on integer optimization, which augments the previously covered optimization models with the flexibility of integer decision variables.