The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming

Similar items

• A Computational Comparison of Branch and Bound and Outer Approximation Algorithms for Mixed Integer Nonlinear Programs

  Scholarly record2007Brian Borchers, John E Mitchell

  In this paper we compare the performance of two codes for convex mixed integer nonlinear programs on a number of test problems The rst code uses a branch and bound algorithm The second code is a commer cially available implementation of an outer approximation algorithm The compar

• Using Interior-point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming

  Scholarly record2010HANDE Y. BENSON

  Interior-point methods for nonlinear programming have been demonstrated to be quite efficient, especially for large scale problems, and, as such, they are ideal candidates for solving the nonlinear subproblems that arise in the solution of mixed-integer nonlinear programming prob

• An algorithmic framework for convex mixed integer nonlinear programs

  Scholarly record2008Discrete 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

  Scholarly record2009PIERRE 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

• An Improved Branch and Bound Algorithm for Mixed Integer Nonlinear Programs. 2 Heuristics for Detecting Fractional Solutions 3 Generating Lower Bounds 4 an Improved Branch and Bound Algorithm

  Scholarly record1994John E. Mitchell, Brian Borchers

  Introduction This paper is concerned with zero{one mixed integer nonlinear programming problems of the form (MINLP) min f(x; y) subject to g(x; y) 0 x 2 f0; 1g m y u y l Here x is a vector of m zero{one variables, y is a vector of n continuous variables, and u and l are vectors o

• A trust region SQP algorithm for mixed-integer nonlinear programming

  Scholarly record2007Optimization LettersOliver Exler, Klaus Schittkowski

  We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a smooth influence on the model functions, i.e., that function values do not change drastically when inor