Linear and Integer Programming

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (42)

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

Explores convex optimization theory, covering local and global minima, convex functions, and applications in various fields.

Convex Optimization: Epigraphs Log in to Mediaspace to watch this video

Explores epigraphs, convexity of bivariate functions, and log-sum-exp functions in convex optimization.

KKT Conditions: Convex Optimization Log in to Mediaspace to watch this video

Explores the KKT conditions in convex optimization, including dual cones, SDP duality, and convex hulls.

Lagrangian Duality: Theory and Applications Log in to Mediaspace to watch this video

Explores Lagrangian duality in convex optimization, discussing strong duality, dual solutions, and practical applications in second-order cone programs.

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

Explores optimization problems in standard form, convex optimization, and optimality criteria.

Cutset Formulation: MST Problem Log in to Mediaspace to watch this video

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

Cones of convex sets Log in to Mediaspace to watch this video

Explores optimization on convex sets, including KKT points and tangent cones.

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.

Linear Programming Basics Log in to Mediaspace to watch this video

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

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

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

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

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

Mixed-Integer Linear Programming: Formulations and Applications Log in to Mediaspace to watch this video

Explores mixed-integer linear programming, binary variables, 0-1 knapsack, assignment problems, and LP relaxation strength.

Integer Programming Basics Log in to Mediaspace to watch this video

Introduces the basics of integer programming, including binary integer programs and constraint strategies.

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.

Convex Optimization: Gradient Descent Log in to Mediaspace to watch this video

Explores VC dimension, gradient descent, convex sets, and Lipschitz functions in convex optimization.

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.

Duality Theorems Log in to Mediaspace to watch this video

Explores duality theorems in linear programming, emphasizing optimal solutions and degeneracies.

Convex Optimization: Sets and Functions Log in to Mediaspace to watch this video

Introduces convex optimization through sets and functions, covering intersections, examples, operations, gradient, Hessian, and real-world applications.

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.

Page 2 of 3