Lecture
Simplex Algorithm: Tableau
Related lectures (36)
Primal-dual Optimization: Extra-Gradient Method
Explores the Extra-Gradient method for Primal-dual optimization, covering nonconvex-concave problems, convergence rates, and practical performance.
Connect Four: Alpha-Beta Pruning and Monte-Carlo Tree Search
Explores solving Connect Four using game theory and algorithms for optimal strategy in minimum time.
Linear Algebra Complexity
Explores the complexity of linear algebra operations and optimization methods, including Gaussian elimination and the simplex method.
Optimal Power Flow Solvers: Next Generation Advancements
Explores advancements in optimal power flow solvers, focusing on multiperiod and security-constrained optimization.
Dynamic Programming: Integer Programming
Covers integer programming, dynamic programming, and optimal solutions complexity.
Convexifying Nonconvex Problems: SDP and SOCP Relaxations
Explores convexifying nonconvex problems using SDP and SOCP relaxations in the context of optimal power flow.