The cutting-plane method is a mathematical optimization technique used to solve problems in convex optimization, particularly in integer programming and other combinatorial optimization problems. The primary idea behind this method is to iteratively refine the feasible region of an optimization problem by adding linear constraints, or "cuts," that eliminate portions of the search space that do not contain optimal solutions.
New to topics? Read the docs here!