A lift-and-project cutting plane algorithm for mixed 0-1 programs
Mathematical Programming: Series A and B
Disjunctive programming: properties of the convex hull of feasible points
Discrete Applied Mathematics
Aggregation and Mixed Integer Rounding to Solve MIPs
Operations Research
Lift-and-project for mixed 0-1 programming: recent progress
Discrete Applied Mathematics
MINLPLib--A Collection of Test Models for Mixed-Integer Nonlinear Programming
INFORMS Journal on Computing
IBM Journal of Research and Development
Cuts for mixed 0-1 conic programming
Mathematical Programming: Series A and B
Conic mixed-integer rounding cuts
Mathematical Programming: Series A and B
FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
INFORMS Journal on Computing
On the separation of disjunctive cuts
Mathematical Programming: Series A and B
An in-out approach to disjunctive optimization
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An algorithmic framework for convex mixed integer nonlinear programs
Discrete Optimization
Operations Research Letters
Hi-index | 0.00 |
This paper addresses the problem of generating cuts for mixed integer nonlinear programs where the objective is linear and the relations between the decision variables are described by convex functions defining a convex feasible region. We propose a new method for strengthening the continuous relaxations of such problems using cutting planes. Our method can be seen as a practical implementation of the lift-and-project technique in the nonlinear case. To derive each cut we use a combination of a nonlinear programming subproblem and a linear outer approximation. One of the main features of the approach is that the subproblems solved to generate cuts are typically not more complicated than the original continuous relaxation. In particular they do not require the introduction of additional variables or nonlinearities. We propose several strategies for using the technique and present preliminary computational evidence of its practical interest. In particular, the cuts allow us to improve over the state of the art branch-and-bound of the solver Bonmin, solving more problems in faster computing times on average.