Lectures related to Linear programming relaxation

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

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

Mixed-Integer Linear Programming: Formulations and Applications

Explores mixed-integer linear programming, binary variables, 0-1 knapsack, assignment problems, and LP relaxation strength.

Branch and Bound: Heuristic Maximization

Explains the Branch and Bound algorithm for heuristic maximization problems using LP relaxations and pruning techniques.

Integer Programs: Optimization and Constraints

Explores integer programs, nonconvex optimization, constraints, and geometric aspects of linear programming for optimal solutions.

Optimization Problems: Path Finding and Portfolio Allocation

Covers optimization problems in path finding and portfolio allocation.

Exact methods: Gomory cuts

Covers the application of Gomory cuts in linear programming problems.

Branch and Bound: Optimization Techniques

Covers the Branch and Bound optimization technique with LP Relaxation and Integral Optimal Solutions.

Optimal Decision Making: Applications of Discrete Optimization

Explores optimal decision making through discrete optimization, emphasizing binary variables and practical applications.

Hedging for LPs

Covers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.

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.