Energy System Modelling: Overview and Optimization Problems

Related lectures (31)

Page 3 of 4

Explores advancements in optimal power flow solvers, focusing on multiperiod and security-constrained optimization.

Explores the complexity of linear algebra operations and optimization methods, including Gaussian elimination and the simplex method.

Explores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.

Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.

Explores the knapsack problem and the traveling salesman problem with a focus on optimization algorithms.

Explores generalization in deep learning, covering model complexity, implicit bias, and the double descent phenomenon.

Introduces the Traveling Salesman Problem and explores approximation methods using Markov chains.

Explores algorithmic challenges, time complexity, optimization, recursion, and probability calculations.

Explores constraints, efficiency, and complexity in linear algebra, emphasizing convexity and worst-case complexity in algorithm analysis.

Covers dynamic programming with a focus on Fibonacci numbers and the rod cutting problem.