IIND-4101 Advanced Optimization
The course presents various optimization subjects, such as lineal programming, restricted optimization, whole and combinatory programming. Among these, some specific subjects include convex analysis, simplex model, degeneration, cycling, duality, sensitivity analysis, Karush-Kuhn-Tucker conditions, inner point algorithm, single-modularity, Branch and Bound method, implicit numbering, decomposition, matroids and non-lineal programming elements.
Catalog page for this course