Concept
Integer programming
Related lectures (140)
Duality Theorems
Explores duality theorems in linear programming, emphasizing optimal solutions and degeneracies.
Linear Programming: Optimization and Constraints
Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.
Dual Translations in Linear Programming
Explores dual translations in linear programming, emphasizing primal and dual formulations and the significance of invertible submatrices.
Integer Programming Basics
Covers the basics of integer programming, focusing on problems with integer values and discussing the simplex algorithm.
Hedging for LPs
Covers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.
Duality in Linear Programming
Explores the concept of duality in linear programming, discussing the relationship between primal and dual problems.
Semi-Definite Programming
Covers semi-definite programming and optimization over positive semidefinite cones.
Convex Polyhedra and Linear Programs
Explores convex polyhedra, linear programs, and their optimization importance.
Prime Numbers: Finding and Testing
Covers the definition of a function to determine if a given number is prime.
Integer Programming: John's Theorem
Explores integer programming, John's Theorem, and the reduction to shortest vector computations in convex bodies.