Lecture

Optimal Power Flow: Constraints and Relaxations

Related lectures (32)

Optimization Methods: Theory Discussion

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Initial BFS

Explores finding the initial Basic Feasible Solution (BFS) in a linear program.

Semi-Definite Programming

Covers semi-definite programming and optimization over positive semidefinite cones.

Convex Relaxation in Optimization

Explores convexifying nonconvex problems through relaxation techniques, illustrated with total variation reconstruction examples.

Convex Optimization Problems: Theory and Applications

Explores convex optimization problems, optimality criteria, equivalent problems, and practical applications in transportation and robotics.

Lagrangian Duality: Theory and Applications

Explores Lagrangian duality in convex optimization, discussing strong duality, dual solutions, and practical applications in second-order cone programs.

Solving Integer Linear Programs

Covers solving integer linear programs graphically, algorithmically, and through optimization methods.

Discrete optimization: Knapsack

Explores modeling classic optimization problems as mixed integer linear problems, focusing on the knapsack problem and its applications.

Optimization Problems: Standard Form

Explores optimization problems in standard form, convex optimization, and optimality criteria.

Approximation Algorithms

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Optimization Problems: Path Finding and Portfolio Allocation

Covers optimization problems in path finding and portfolio allocation.

Lagrangian Duality: Convex Optimization

Explores Lagrangian duality in convex optimization, transforming problems into min-max formulations and discussing the significance of dual solutions.

Convex Optimization Problems: Standard Form

Covers convex optimization problems, transformation to standard form, and optimality criteria for differentiable objectives.

Optimal Decision Making: Sensitivity Analysis

Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.

Linear Programming: Optimization and Constraints

Introduces linear programming, emphasizing optimization with constraints and practical examples.

Optimal Decision Making: Exercises & Solutions

Covers exercises and solutions in translating text problems into linear programming and optimizing decision-making processes.

Cutset Formulation: MST Problem

Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.

Optimisation in Energy Systems

Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.

Primal-dual Optimization III: Lagrangian Gradient Methods

Explores primal-dual optimization methods, emphasizing Lagrangian gradient techniques and their applications in data optimization.

Optimal Decision Analysis

Explores strong duality, complementary slackness, economic interpretation, and stochastic problem scenarios in linear programming.