Can Li

Lecture 25 Bilevel Optimization

Lecture 24 Augmented Lagrangian and ADMM

Lecture 23 Lagrangian Relaxation and Decomposition

Lecture 22 Column Generation and Dantzig Wolfe Decomposition

Lecture 21 Stochastic Programming and Benders Decomposition

Lecture 20 Decomposition Algorithms for MINLP

Lecture 19 Branch and Reduce

Lecture 18 Convex Relaxation

Lecture 17 Nonconvex Optimization Applications

Lecture 16 MIP Solvers

Lecture 15 Cutting Planes

Lecture 14 Branch and Bound

Lecture 13 Mixed Integer Linear Programming Applications

Lecture 12 Formulating Mixed Integer Linear Programming Models

Lecture 11 Modeling of Discrete and Continuous Decisions

Lecture 10 Nonlinear Programming Algorithms

Lecture 9 Langrangian Dual and Optimality Conditions

Lecture 8 Conic Programming

Lecture 7 Linear Programming Duality

Lecture 6 Simplex Algorithm

Lecture 5 Polyhedron Theory

Lecture 4 Linear Programming Applications

Lecture 3 Unconstrained Optimization

Lecture 2 Convex Sets and Functions

Recitation Linear Algebra and Calculus Review

Lecture 1 Introduction to Computational Optimization

FaultExplainer demo

OptiChat demo

scChat demo

Final Review