Nonlinear Optimization
- Formulation of Integer Programming Problems
- Linearization of Either-Or and If-Then Constraints
- Separable Programming, Piecewise Linear Functions
- Branch and Bound Method
- Branch and Bound for Knapsack and Traveling Salesman Problems
- Implicit Enumeration Method
- Cutting Plane Method
- Introduction to Convex Functions, Convexity Detection Methods, Operations Preserving Convexity
- Review of Single-Variable Nonlinear Optimization
- Unconstrained Multivariable Nonlinear Optimization (Theorems and Optimality Conditions)
- Unconstrained Multivariable Nonlinear Optimization (Iterative Algorithms)
- Constrained Multivariable Nonlinear Optimization, Dual Formulation
- Karush-Kuhn-Tucker (KKT) Conditions
- Convex Optimization
- Constrained Multivariable Nonlinear Optimization (Iterative Algorithms)