An algorithmic framework for convex mixed integer nonlinear programs

Similar items

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

  Open-access article2020Journal of Global OptimizationPavloMuts, IvoNowak, Eligius M. T.Hendrix

• 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

• A New Sequential Cutting Plane Algorithm for Solving Mixed Integer Nonlinear Programming Problems

  Scholarly record2007Claus Still

  This paper presents a new algorithm for solving mixed integer nonlinear programming problems. The algorithm uses a branch and bound strategy where a nonlinear programming problem is solved in each integer node of the tree. The nonlinear programming problems, at each integer node

• Improved quadratic cuts for convex mixed-integer nonlinear programs

  Scholarly record2018Computers & Chemical EngineeringLijie 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

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

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