Cutting-plane method

Related lectures (30)

Page 2 of 3

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

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

Introduces optimisation problems, methods, and constraints for solving multi-dimensional problems with and without constraints.

Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.

Explores optimal integer programming, Gomory cuts, and an iterative rounding heuristic.

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

Explores the Branch and Bound algorithm in discrete optimization, efficiently finding optimal solutions by calculating lower bounds on subsets.

Explores optimization problems, feasible regions, and objective functions with a focus on Lagrange multipliers and convexity.

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

Covers the application of Gomory cuts in linear programming problems.