Exact methods: Branch and Bound

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (49)

Linear Programming Basics Log in to Mediaspace to watch this video

Covers deriving basic linear program representation, finding solutions, and exploring optimality.

Solving Linear Programs: SIMPLEX Method Log in to Mediaspace to watch this video

Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.

Integer Programs: Optimization and Constraints Log in to Mediaspace to watch this video

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

Linear Programming: Extreme Points Log in to Mediaspace to watch this video

Explores extreme points in linear programming and the role of constraints in finding optimal solutions.

Relations Between Events Log in to Mediaspace to watch this video

Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.

Introduction to Optimization Log in to Mediaspace to watch this video

Covers the basics of optimization, including historical perspectives, mathematical formulations, and practical applications in decision-making problems.

Branch & Bound Algorithm: LP Based Approach Log in to Mediaspace to watch this video

Explores the LP-based Branch & Bound algorithm for finding optimal solutions.

Linear Programming: Solving LPs Log in to Mediaspace to watch this video

Covers the process of solving Linear Programs (LPs) using the simplex method.

Linear Programming: Two-phase Simplex Algorithm Log in to Mediaspace to watch this video

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

Two-phase Simplex Algorithm: Introduction and Duality Log in to Mediaspace to watch this video

Introduces the two-phase simplex algorithm and explores duality in linear programming.

Linear Optimization: Finding Initial BFS Log in to Mediaspace to watch this video

Explains the process of finding an initial Basic Feasible Solution for linear optimization problems using the Simplex Algorithm.

Network Flows Meets Simplex Log in to Mediaspace to watch this video

Explores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.

Optimal Decision Making: The Simplex Method Log in to Mediaspace to watch this video

Introduces the Simplex Method for optimal decision making in linear programming, covering basic and advanced concepts.

Robust Optimization: Polynomial Approximation & Uncertainty Sets Log in to Mediaspace to watch this video

Explores robust optimization through polynomial approximation and uncertainty sets, including robust linear programs and optimization tricks.

Linear Programming Duality Log in to Mediaspace to watch this video

Explores the concept of duality in linear programming and its practical implications in optimization.

Dynamic Programming: Integer Programming Log in to Mediaspace to watch this video

Covers integer programming, dynamic programming, and optimal solutions complexity.

The Simplex Algorithm: Efficiency and Degeneracy Log in to Mediaspace to watch this video

Covers the Simplex Algorithm, focusing on efficiency and degeneracy in linear optimization problems.

Simplex Method: Basics and Applications Log in to Mediaspace to watch this video

Covers the basics of the Simplex method and its application in solving optimization problems.

Network Flows with Capacities: Revisited Log in to Mediaspace to watch this video

Revisits network flows with capacities, focusing on bounded flow problems and different formulations to approach them.

Gradient Descent: Optimization and Constraints Log in to Mediaspace to watch this video

Discusses gradient descent for optimization with equality constraints and iterative convergence criteria.

Page 2 of 3