Linear programming relaxation

Formal sciences
Theoretical computer science
Algorithms and data structures
Combinatorial optimization

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Page 2 of 4

Convex Relaxation: Negative Type Theorems

Explores convex relaxation and negative type theorems in convex programs.

Solving Integer Linear Programs

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

Energy Conversion Systems Optimization

Explores energy conversion systems optimization through heat recovery and mixed integer linear programming.

Duality, Constraint relaxation

Explores duality and constraint relaxation in optimization problems with practical examples.

Optimal Decision Making: Integer Programming

Covers integer programming, convex hulls, Gomory cutting planes, and branch and bound methods.

Branch & Bound: Optimization

Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.

Energy System Modeling: Optimization and Performance Indicators

Explores energy system modeling using optimization techniques and performance indicators.

Discrete optimization: Knapsack

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

Hedging for LPs

Covers the Hedge algorithm for minimizing loss in linear programming problems.

Optimization Methods: Theory Discussion

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