Optimal Decision Making: Integer Programming

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Page 1 of 4

Cutset Formulation: MST Problem

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

Linear Programming: Weighted Bipartite Matching

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

Linear Programming Basics

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

Optimization Problems: Path Finding and Portfolio Allocation

Covers optimization problems in path finding and portfolio allocation.

Optimization Methods: Theory Discussion

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

Exact methods: Branch and Bound

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

Discrete Optimization: Relaxation

Explores solving discrete optimization problems by relaxing integrality constraints.

Solving Integer Linear Programs

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

Approximation Algorithms

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

Optimal Decision Making: Applications of Discrete Optimization

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