Exact methods: Branch and Bound

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Page 2 of 4

Simplex Algorithm: Exercises & Interpretation

Covers exercises on the Simplex Algorithm, optimizing solutions subject to linear constraints.

Optimization Problems: Path Finding and Portfolio Allocation

Covers optimization problems in path finding and portfolio allocation.

Linear Programming Basics

Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.

Branch and Bound: Heuristic Maximization

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

Simplex Algorithm: Basics

Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.

Branch and Bound: Optimization Techniques

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

Simplex Algorithm: Tableau

Covers the main idea behind the Simplex algorithm and explains the Tableau method for solving linear programming problems.

Linear Programming Basics

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

Discrete Optimization: Definitions

Covers definitions and concepts in discrete optimization, including binary linear problems and combinatorial optimization.

Solving Linear Programs: SIMPLEX Method

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