ویراساینس.
سند علمی

Improved quadratic cuts for convex mixed-integer nonlinear programs

Lijie Su, Lixin Tang, David E. Bernal, Ignacio E. Grossmann

چکیده

This paper presents scaled quadratic cuts based on scaling the second-order Taylor expansion terms for the decomposition methods Outer Approximation (OA) and Partial Surrogate Cuts (PSC) used for solving convex Mixed Integer Nonlinear Programing (MINLP). The scaled quadratic cut is proved to be a stricter and tighter underestimation for the convex nonlinear functions than the classical supporting hyperplanes which results in the improvement of efficiency of the OA and PSC based MINLP solution methods. We integrate the strategies of the scaled quadratic cuts with multi-generation cuts with OA and PSC, and develop six types of MINLP solution methods with scaled quadratic cuts. This improvement transforms the master problem of the decomposition methods in a Mixed Integer Quadratically Constrained Programming (MIQCP) problem. Numerical results of benchmark MINLP problems demonstrate the effectiveness of the proposed MINLP solution methods with scaled quadratic cuts. * Corresponding author. E-mail address: Lixintang@mail.neu.edu.cn (Lixin Tang) 2

اسناد مشابه

  • Convex quadratic relaxations for mixed-integer nonlinear programs in power systems

    سند علمی۲۰۱۷Math. Program. Comput.Hassan L. Hijazi, Carleton Coffrin, Pascal Van Hentenryck

    Abstract This paper presents a set of new convex quadratic relaxations for nonlinear and mixed-integer nonlinear programs arising in power systems. The considered models are motivated by hybrid discrete/continuous applications where existing approximations do not provide optimali

  • An algorithmic framework for convex mixed integer nonlinear programs

    سند علمی۲۰۰۸Discrete OptimizationPierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols

    This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software for solving large-scale problems. Moreover, both fundamental building blocks, namely mixed integer lin

  • Algorithms and Software for Convex Mixed Integer Nonlinear Programs

    سند علمی۲۰۰۹PIERRE BONAMI, MUSTAFA KILINÇ, JEFF LINDEROTH

    This paper provides a survey of recent progress and software for solving convex mixed integer nonlinear programs (MINLP)s, where the objective and constraints are defined by convex functions and integrality restrictions are imposed on a subset of the decision variables. Convex MI

  • Non-convex mixed-integer nonlinear programming: A survey

    سند علمی۲۰۱۲Samuel Burer, Adam N. Letchford

    A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are available. When nonconvexiti

  • Extended ant colony optimization for non-convex mixed integer nonlinear programming

    سند علمی۲۰۰۹Computers & ORMartin Schlüter, Jose A. Egea, Julio R. Banga

    Two novel extensions for the well known Ant Colony Optimization (ACO) framework are introduced here, which allow the solution of Mixed Integer Nonlinear Programs (MINLP). Furthermore, a hybrid implementation (ACOmi) based on this extended ACO framework, specially developed for co

  • Disjunctive Cuts for Mixed Integer Nonlinear Programming Problems

    سند علمی۲۰۱۲Pierre Bonami, Jeff Linderoth, Andrea Lodi

    We survey recent progress in applying disjunctive programming theory for the effective solution of mixed integer nonlinear programming problems. Generation of effective cutting planes is discussed for both the convex and nonconvex cases.