Solving mixed integer nonlinear programs by outer approximation

@article{Fletcher1994SolvingMI,
  title={Solving mixed integer nonlinear programs by outer approximation},
  author={Roger Fletcher and Sven Leyffer},
  journal={Mathematical Programming},
  year={1994},
  volume={66},
  pages={327-349}
}
A wide range of optimization problems arising from engineering applications can be formulated as Mixed Integer NonLinear Programming problems (MINLPs). Duran and Grossmann (1986) suggest an outer approximation scheme for solving a class of MINLPs that are linear in the integer variables by a finite sequence of relaxed MILP master programs and NLP subproblems.Their idea is generalized by treating nonlinearities in the integer variables directly, which allows a much wider class of problem to be… 

An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs

A common structure in convex mixed-integer nonlinear programs (MINLPs) is separable nonlinear functions and three improvements to the outer approximation algorithms are proposed, including a simple extended formulation and a heuristic inner approximation of the feasible region.

Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs

A rigorous decomposition approach to solve separable mixed-integer nonlinear programs where the participating functions are nonconvex is presented and numerical results are compared with currently available algorithms for example problems, illuminating the potential benefits of the proposed algorithm.

Continuous optimization methods for onvex mixed-integer nonlinear programming

The topic of this dissertation is the design of fast branch-and-bound algorithms that use intelligently adapted approaches from continuous optimization for solving convex mixed-integer nonlinear

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

Preliminary numerical results show that due to the generated cuts in the LP phase, on average only 2–3 MIP problems have to be solved in the MIP phase.

FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs

A new solver for convex mixed-integer nonlinear programs (MINLPs) that implements a linearization-based algorithm that avoids the complete re-solution of a master mixed- integer linear program (MILP) by adding new linearizations at open nodes of the branch-and-bound tree whenever an integer solution is found.

Polyhedral Approximation Strategies in Nonconvex Mixed-Integer Nonlinear Programming*

Some extensions to SHOT are discussed that significantly extend its applicability to nonconvex problems, including utilizing convexity detection for selecting the nonlinearities to linearize, lifting reformulations for special classes of functions, feasibility relaxations for infeasible subproblems and adding objective cuts to force the search for better feasible solutions.

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

This paper proposes the exact primal-dual penalty approach, and examines cases where the nonlinear subproblems take on special forms, namely those of second-order cone programming problems and semidefinite programming problems.

FilMINT: An Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs

A new solver for mixed integer nonlinear programs (MINLPs) that implements a linearization-based algorithm, FilMINT, that avoids the complete solution of master mixed integer linear programs (MILPs) by adding new linearizations at open nodes of the branch-and-bound tree whenever an integer solution is found.

AN IMPROVED DIRECT SEARCH APPROACH FOR SOLVING MIXED-INTEGER NONLINEAR PROGRAMMING PROBLEMS

The strategy of releasing non-basic variables from their bounds, combined with the "active constraint" method and the notion of super-basics, has been developed for efficiently tackling the special class of a nonlinear mathematical programming problem.

Outer approximation for global optimization of mixed-integer quadratic bilevel problems

It turns out that the proposed methods are capable of solving bilevel instances with several thousand variables and constraints and significantly outperform classical solution approaches.
...

References

SHOWING 1-10 OF 13 REFERENCES

An outer-approximation algorithm for a class of mixed-integer nonlinear programs

An outer-approximation algorithm is presented for solving mixed-integer nonlinear programming problems of a particular class and a theoretical comparison with generalized Benders decomposition is presented on the lower bounds predicted by the relaxed master programs.

Generalized Benders decomposition

J. F. Benders devised a clever approach for exploiting the structure of mathematical programming problems withcomplicating variables (variables which, when temporarily fixed, render the remaining

A combined penalty function and outer-approximation method for MINLP optimization : applications to distillation column design

An improved outer-approximation algorithm for MINLP optimization has been recently proposed which is aimed at the solution of problems where convexity conditions may not hold and it is shown that the proposed algorithm can effectively handle design problems.

A new branching rule for the branch and bound algorithm for solving nonlinear integer programming problems

We examine a branch and bound algorithm for solving nonlinear (convex) integer programming problems. In this note we generalize previous results for the quadratic case. The variables are branched in

Decomposition in general mathematical programming

A unifying framework is presented for the generalization of the decomposition methods originally developed by Benders and Dantzig and Wolfe and is argued to be a direct consequence of a fundamental asymmetry that resides in the Tind-Wolsey duality theory.

Improved algorithm for mixed-integer quadratic programs and a computational study

An improved version of this algorithm for solving complicated mixed-integer quadratic programs, based on an equivalent formulation that employs a nonsingular transformation of variables is presented.

Stability, Duality and Decomposition in General Mathematical Programming

This is an excellent and heavily technical book in mathematical programming from Flippo. The book is divided into three separate and self-contained parts dealing with the three notions of Stability,

Practical Methods of Optimization

The aim of this book is to provide a Discussion of Constrained Optimization and its Applications to Linear Programming and Other Optimization Problems.

Branch and bound experiments in zero-one programming

This paper investigates, both from a theoretical and practical point of view, the ability of a general branch and bound approach to solve pure zero-one programming problems. Large scale experiments