MAT 168 Optimization (Matthias Köppe; Fall 2020)
MAT 168 Optimization (Matthias Köppe; Fall 2020)
The following topics are covered in this course:
- Modeling: Examples of optimization problems.
- Graphical method for solving linear programs with 2 variables
- AMPL: a software for modeling and solving linear programs
- Simplex method: dictionary of simplex method, pivoting, ratio test …
- Duality, complementary slackness, dual simplex method
- Phase 1 + 2 methods
- Degeneracy + finite termination; the perturbation method
- Transportation problem + network flow + shortest path problem + max flow problem
- Integer Programming modeling – fixed cost / network design, Boolean logic, 0-1 Knapsack
- Branch and bound method for solving general IP
Videos and all other materials are copyright 2020 Matthias Köppe and shared as Open Educational Resources subject to the Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) license.
-
2020-12-11: Non-convex piecewise linear modeling…
-
2020-12-09-b: Convex piecewise linear modeling…
-
2020-12-09-a: Modeling with convex multipliers…
-
2020-12-07: Stable set problem, induced face…
-
2020-12-04: Stable set problem, formulations/cuts…
-
2020-12-02: Facility location, Chvatal-Gomory…
-
2020-11-30: Logical and mixed 0/1 modeling (MAT…
-
2020-11-25: Undirected min-cut formulations (MAT…
-
2020-11-23: Cutting plane algorithms (MAT 168…
-
2020-11-20: TSP formulations: strength,…
-
2020-11-18: Traveling salesperson problem (TSP)
-
2020-11-16: LP duality, complementarity (MAT 168…
-
2020-11-13: Strong LP duality theorem (MAT 168…
-
2020-11-09: Weak LP duality theorem (MAT 168…
-
2020-11-06: Multi-commodity flow, transformations…
Search for ""