MAT3007
Optimization
CUHK-Shenzhen · Spring 2026
Topics covered
- Linear programming: Modeling, transformations, geometry, and the simplex method.
- Duality & integer optimization: Duality theory, sensitivity analysis, LP relaxation, and branch-and-bound.
- Optimality & convexity: Unconstrained and constrained optimality, KKT conditions, and convex optimization.
- Nonlinear optimization: Algorithms for nonlinear problems.