Lecture
Solving Integer Linear Programs
Related lectures (55)
Duality in Linear Programming
Explores the concept of duality in linear programming, discussing the relationship between primal and dual problems.
Optimization with Constraints: KKT Conditions
Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.
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.
Branch and Bound: Optimization Techniques
Covers the Branch and Bound optimization technique with LP Relaxation and Integral Optimal Solutions.
Initial BFS
Explores finding the initial Basic Feasible Solution (BFS) in a linear program.
Thermodynamic Properties: Equations and Models
Explains thermodynamic properties, equations of state, and mixture rules for energy systems modeling.
The Hidden Convex Optimization Landscape of Deep Neural Networks
Explores the hidden convex optimization landscape of deep neural networks, showcasing the transition from non-convex to convex models.
Optimisation in Energy Systems
Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.
Energy Conversion Systems Optimization
Explores energy conversion systems optimization through heat recovery and mixed integer linear programming.