Integer Programming Basics

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.

Branch and Bound: Heuristic Maximization Log in to Mediaspace to watch this video

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

Optimization Problems: Path Finding and Portfolio Allocation Log in to Mediaspace to watch this video

Covers optimization problems in path finding and portfolio allocation.

Simplex Algorithm: Exercises & Interpretation Log in to Mediaspace to watch this video

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

Semi-Definite Programming Log in to Mediaspace to watch this video

Covers semi-definite programming and optimization over positive semidefinite cones.

Dynamic Programming: Steinitz Sequence Log in to Mediaspace to watch this video

Explores dynamic programming with the Steinitz sequence to optimize solutions efficiently.

Convex Optimization Problems: Theory and Applications Log in to Mediaspace to watch this video

Explores convex optimization problems, optimality criteria, equivalent problems, and practical applications in transportation and robotics.

Linear Optimization: Auxiliary Problem Log in to Mediaspace to watch this video

Explores the formulation of the auxiliary problem in linear optimization and its role in optimal decision-making.

Duality: Economic Interpretation Log in to Mediaspace to watch this video

Explores duality in linear programming, strong duality, complementary slackness, and the economic interpretation of dual variables as prices.

Optimal Decision Making: Integer Programming Log in to Mediaspace to watch this video

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

Dual Translations in Linear Programming Log in to Mediaspace to watch this video

Explores dual translations in linear programming, emphasizing primal and dual formulations and the significance of invertible submatrices.

Integer Program Formulation Log in to Mediaspace to watch this video

Covers the process of formulating integer programs and improving solutions.

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.

Optimal Decision Making: Applications of Discrete Optimization Log in to Mediaspace to watch this video

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

Optimization Principles Log in to Mediaspace to watch this video

Covers optimization principles, including linear optimization, networks, and concrete research examples in transportation.

Lagrangian Duality: Convex Optimization Log in to Mediaspace to watch this video

Explores Lagrangian duality in convex optimization, transforming problems into min-max formulations and discussing the significance of dual solutions.

Convex Optimization Problems: Standard Form Log in to Mediaspace to watch this video

Covers convex optimization problems, transformation to standard form, and optimality criteria for differentiable objectives.

Optimization Programs: Piecewise Linear Cost Functions Log in to Mediaspace to watch this video

Covers the formulation of optimization programs for minimizing piecewise linear cost functions.

Multistage Games: Extensive Form and Feedback Strategies Log in to Mediaspace to watch this video

Explores multistage games, focusing on extensive form and feedback strategies, including Nash equilibria and backward induction methods.

Convex Relaxation: Negative Type Theorems Log in to Mediaspace to watch this video

Explores convex relaxation and negative type theorems in convex programs.

Page 2 of 3