page_title: Cutting-plane method
hierarchical_section_title: Cutting-plane method
caption_attribution_description: Illustrates the intersection of the unit cube with the cutting plane x 1 + x 2 + x 3 &#x2265; 2 {\displaystyle x_{1}+x_{2}+x_{3}\geq 2} . In the context of the Traveling salesman problem on three nodes, this (rather weak) inequality states that every tour must have at least two edges.
context_page_description: In mathematical optimization, the cutting-plane method is any of a variety of optimization methods that iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts. Such procedures are commonly used to find integer solutions to mixed integer linear programming problems, as well as to solve general, not necessarily differentiable convex optimization problems. The use of cutting planes to solve MILP was introduced by Ralph E. Gomory.
  Cutting plane methods for MILP work by solving a non-integer linear program, the linear relaxation of the given integer program. The theory of Linear Programming dictates that under mild assumptions, one can always find an extreme point or a corner point that is optimal. The obtained optimum is tested for being an integer solution. If it is not, there is guaranteed to exist a linear inequality that separates the optimum from the convex hull of the true feasible set. Finding such an inequality is the separation problem, and such an inequality is a cut. A cut can be added to the relaxed linear program. Then, the current non-integer solution is no longer feasible to the relaxation.
context_section_description: In mathematical optimization, the cutting-plane method is any of a variety of optimization methods that iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts.  Such procedures are commonly used to find integer solutions to mixed integer linear programming (MILP) problems, as well as to solve general, not necessarily differentiable convex optimization problems.  The use of cutting planes to solve MILP was introduced by Ralph E. Gomory.
  Cutting plane methods for MILP work by solving a non-integer linear program, the linear relaxation of the given integer program. The theory of Linear Programming dictates that under mild assumptions (if the linear program has an optimal solution, and if the feasible region does not contain a line), one can always find an extreme point or a corner point that is optimal. The obtained optimum is tested for being an integer solution. If it is not, there is guaranteed to exist a linear inequality that separates the optimum from the convex hull of the true feasible set. Finding such an inequality is the separation problem, and such an inequality is a cut.  A cut can be added to the relaxed linear program. Then, the current non-integer solution is no longer feasible to the relaxation. This process is repeated until an optimal integer solution is found.
  Cutting-plane methods for general convex continuous optimization and variants are known under various names: Kelley's method, Kelley–Cheney–Goldstein method, and bundle methods.  They are popularly used for non-differentiable convex minimization, where a convex objective function and its subgradient can be evaluated efficiently but usual gradient methods for differentiable optimization can not be used.  This situation is most typical for the concave maximization of Lagrangian dual functions.  Another common situation is the application of the Dantzig–Wolfe decomposition to a structured optimization problem in which formulations with an exponential number of variables are obtained.  Generating these variables on demand by means of delayed column generation is identical to performing a cutting plane on the respective dual problem.
caption: The intersection of the unit cube with the cutting plane 
    
      
        
          
            x
            
              1
            
          
          +
          
            x
            
              2
            
          
          +
          
            x
            
              3
            
          
          ≥
          2
        
      
      {\displaystyle x_{1}+x_{2}+x_{3}\geq 2}
    
  . In the context of the Traveling salesman problem on three nodes, this (rather weak[why?]) inequality states that every tour must have at least two edges.
exif: {}