Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729): Difference between revisions

This paper deals with the generalization of split, \(k\)-branch split, and intersection cuts from mixed integer linear programming to the area of mixed integer nonlinear programming. Two techniques are presented that can be used to construct formulas for split, \(k\)-branch split, and general intersection cuts for several classes of convex sets. The authors first introduce an interpolation technique that can be used to construct split and \(k\)-branch split cuts for many classes of sets. Then, the interpolation technique is used to characterize intersection cuts for conic quadratic sets. The authors also introduce an aggregation technique that can be used to construct a wide array of general intersection cuts. The basic principles behind the techniques is presented in a simple, but abstract setting, and then it is utilized to construct more specific cuts to illustrate their power and limitations.