Lecture
Discrete Optimization: Set Covering
Related lectures (32)
Optimization Methods: Theory Discussion
Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.
Thermodynamic Properties: Equations and Models
Explains thermodynamic properties, equations of state, and mixture rules for energy systems modeling.
Discrete Optimization: Traveling Salesman ProblemMOOC: Optimization: principles and algorithms - Linear optimization
Covers the traveling salesman problem, modeling, constraints, additional constraints, and network representation.
Optimisation in Energy Systems
Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.
Discrete Optimization: RelaxationMOOC: Optimization: principles and algorithms - Linear optimization
Explores solving discrete optimization problems by relaxing integrality constraints.
Traveling Salesman Problem: Introduction and Approximation Methods
Introduces the Traveling Salesman Problem and explores approximation methods using Markov chains.
Exact methods: Branch and BoundMOOC: Optimization: principles and algorithms - Linear optimization
Explores the Branch and Bound algorithm in discrete optimization, efficiently finding optimal solutions by calculating lower bounds on subsets.
Discrete Optimization: The Curse of DimensionalityMOOC: Optimization: principles and algorithms - Linear optimization
Delves into the curse of dimensionality in discrete optimization, highlighting the challenges of exponential computational time growth with problem size.
Hedging for LPs
Covers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.
Optimization with Constraints: KKT Conditions
Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.