Lecture

Branch & Bound Algorithm: LP Based Approach

Related lectures (32)

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

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.

Cutset Formulation: MST Problem

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

Optimal Decision Making: Sensitivity Analysis

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

Optimization Methods: Theory Discussion

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

Linear Programming: Two-phase Simplex Algorithm

Covers the application of the two-phase Simplex algorithm to solve linear programming problems.

Integer Optimization: Theory and Applications

Covers the fundamentals of integer optimization, including integer programming, dynamic programming, and approximation algorithms.

Optimisation in Energy Systems

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

Linear Programming: Weighted Bipartite Matching

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Optimal Decision Making: Integer Programming

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

Branch and Bound: Heuristic Maximization

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

Hedging for LPs

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

Optimization: Classical Problems

Covers classical optimization problems, brute force algorithms, and integer linear optimization.

Exact Methods for Integer Optimization

Covers exact methods for integer optimization, emphasizing Branch and Bound techniques.

Portfolio Theory: Risk Parity Strategy

Explores Portfolio Theory with a focus on the Risk Parity Strategy, discussing asset allocation proportional to the inverse of volatility and comparing different diversified portfolios.

Linear Programming Techniques in Reinforcement Learning

Covers the linear programming approach to reinforcement learning, focusing on its applications and advantages in solving Markov decision processes.

Solving Integer Linear Programs

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

Exact methods: Branch and Bound

Explores the Branch and Bound algorithm in discrete optimization, efficiently finding optimal solutions by calculating lower bounds on subsets.

Branch and Bound: Optimization Techniques

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