Integer programming

Formal sciences
Theoretical computer science
Algorithms and data structures
Combinatorial optimization

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Page 3 of 4

Optimal Decision Making: Integer Programming

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

Linear Programming Basics

Explores linear programming basics, including basic solutions, feasible solutions, optimal solutions, and challenges in solving integer programming problems.

Linear Programming: Weighted Bipartite Matching

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

Energy Conversion Systems Optimization

Explores energy conversion systems optimization through heat recovery and mixed integer linear programming.

Discrete Optimization: Definitions

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

Optimal Decision Making: Applications of Discrete Optimization

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

Integer Hull: General Case

Covers the concept of the integer hull in the general case, focusing on the proof of claim and the properties of cells.

Solving Integer Linear Programs

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

Dognion's Theorem

Covers Dognion's Theorem, explaining the proof of infeasible Integer Programming problems.

Hedging for LPs

Covers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.