Cutting-plane method

Related lectures (30)

Page 3 of 3

Covers dual transformation, relaxed formulation, and solving using separation oracle and subgradient methods.

Covers the fundamentals of integer programming and network flows in directed graphs.

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Covers the transhipment problem, the incidence matrix, and total unimodularity.

Covers the modelling and optimization of energy systems, focusing on solving optimization problems with constraints and variables.

Explores the formulation of the auxiliary problem in linear optimization and its role in optimal decision-making.

Explores integer programs, nonconvex optimization, constraints, and geometric aspects of linear programming for optimal solutions.

Delves into Pareto optimization techniques for generating system configurations and making decisions efficiently.

Explores proximal operators, subgradient methods, and composite minimization in optimization.

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