An algorithmic framework for convex mixed integer nonlinear programs

DOI10.1016/j.disopt.2006.10.011zbMath1151.90028OpenAlexW2170213261MaRDI QIDQ951092

Lorenz T. Biegler, Pierre Bonami, Andrew R. Conn, Andrea Lodi, Andreas Wächter, Jon Lee, Ignacio E. Grossmann, Carl D. Laird, Margot, François, Cornuéjols, Gérard, Nicolas W. Sawaya

Publication date: 29 October 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2006.10.011

zbMATH Keywords

branch-and-boundopen-sourceouter-approximationMINLP test problems

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11)

Related Items (only showing first 100 items - show all)

Three ideas for a feasibility pump for nonconvex MINLP ⋮ Genomic feature selection by coverage design optimization ⋮ Constructing Lattice-Free Gradient Polyhedra in Dimension Two ⋮ Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming ⋮ Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming ⋮ An Algorithmic Framework for MINLP with Separable Non-Convexity ⋮ On handling indicator constraints in mixed integer programming ⋮ A Lagrangian decomposition approach for the pump scheduling problem in water networks ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ Perspective reformulations of mixed integer nonlinear programs with indicator variables ⋮ Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations ⋮ Extended Formulations in Mixed-Integer Convex Programming ⋮ Bound reduction using pairs of linear inequalities ⋮ Deterministic global optimization in ab-initio quantum chemistry ⋮ Mixed integer nonlinear programming tools: an updated practical overview ⋮ Active Set Methods with Reoptimization for Convex Quadratic Integer Programming ⋮ An interior point method for nonlinear programming with infeasibility detection capabilities ⋮ Interactive dynamic optimization server – connecting one modelling language with many solvers ⋮ Mixed-Integer Convex Representability ⋮ Solving a production-routing problem with price-dependent demand using an outer approximation method ⋮ A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines ⋮ Validation of nominations in gas network optimization: models, methods, and solutions ⋮ Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 ⋮ Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint ⋮ SDP-based branch-and-bound for non-convex quadratic integer optimization ⋮ Two linear approximation algorithms for convex mixed integer nonlinear programming ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities ⋮ A partial outer convexification approach to control transmission lines ⋮ Scheduling of network tasks to minimize the consumed energy ⋮ Complex portfolio selection via convex mixed‐integer quadratic programming: a survey ⋮ On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition ⋮ Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods ⋮ MINLP‐based hybrid strategy for operating mode selection of TES‐backed‐up refrigeration systems ⋮ Sparse convex optimization toolkit: a mixed-integer framework ⋮ Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables ⋮ Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Approximation Properties and Tight Bounds for Constrained Mixed-Integer Optimal Control ⋮ Robust tube-based NMPC for dynamic systems with discrete degrees of freedom ⋮ Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems ⋮ Bounds and convex heuristics for bi-objective optimal experiment design in water networks ⋮ An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs ⋮ On the Weber facility location problem with limited distances and side constraints ⋮ Quadratic Combinatorial Optimization Using Separable Underestimators ⋮ Undercover: a primal MINLP heuristic exploring a largest sub-MIP ⋮ An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand ⋮ Lift-and-Project Cuts for Mixed Integer Convex Programs ⋮ Global solution of non-convex quadratically constrained quadratic programs ⋮ Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts ⋮ Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization ⋮ The travelling salesman problem with neighbourhoods: MINLP solution ⋮ A primal heuristic for optimizing the topology of gas networks based on dual information ⋮ Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty ⋮ The capacitated transshipment location problem with stochastic handling utilities at the facilities ⋮ Outer-approximation algorithms for nonsmooth convex MINLP problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints ⋮ QPLIB: a library of quadratic programming instances ⋮ Route optimization for multiple searchers ⋮ Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming ⋮ On combining machine learning with decision making ⋮ The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming ⋮ When is rounding allowed in integer nonlinear optimization? ⋮ On Minimal Valid Inequalities for Mixed Integer Conic Programs ⋮ Global Solution of Bilevel Programming Problems ⋮ Majority judgment over a convex candidate space ⋮ Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocks ⋮ Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming ⋮ Using regularization and second order information in outer approximation for convex MINLP ⋮ Static Analysis by Abstract Interpretation: A Mathematical Programming Approach ⋮ Granularity in nonlinear mixed-integer optimization ⋮ A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming ⋮ Improving the performance of DICOPT in convex MINLP problems using a feasibility pump ⋮ An overview of exact algorithms for the Euclidean Steiner tree problem inn-space ⋮ Mixed integer nonlinear programming using interior-point methods ⋮ Template polyhedra and bilinear optimization ⋮ On support vector machines under a multiple-cost scenario ⋮ Conflict Analysis for MINLP ⋮ A Mixed-Integer Fractional Optimization Approach to Best Subset Selection ⋮ Ten years of feasibility pump, and counting ⋮ A decomposition method for MINLPs with Lipschitz continuous nonlinearities ⋮ Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization ⋮ Global optimality bounds for the placement of control valves in water supply networks ⋮ Maximizing the storage capacity of gas networks: a global MINLP approach ⋮ Operational decisions for multi-period industrial gas pipeline networks under uncertainty ⋮ Optimal location of green zones in metropolitan areas to control the urban heat island ⋮ An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs ⋮ Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints ⋮ Minotaur: a mixed-integer nonlinear optimization toolkit ⋮ A hybrid LP/NLP paradigm for global optimization relaxations ⋮ Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound ⋮ A disjunctive cut strengthening technique for convex MINLP ⋮ Inversion of convection-diffusion equation with discrete sources ⋮ Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections ⋮ Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming ⋮ The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities ⋮ Global optimization with spline constraints: a new branch-and-bound method based on B-splines

Uses Software

• MIPLIB
• COIN-OR
• filterSQP
• Bonmin
• Ipopt
• DICOPT
• SBB

Cites Work

• Unnamed Item
• Different transformations for solving non-convex trim-loss problems by MINLP
• Solving mixed integer nonlinear programs by outer approximation
• Generalized convex disjunctive programming: Nonlinear convex hull relaxation
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Branching rules revisited
• A branch-and-cut method for 0-1 mixed convex programming
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Generalized Benders decomposition
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• A Computational Study of Search Strategies for Mixed Integer Programming
• Experiments in mixed-integer linear programming
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• Computational combinatorial optimization. Optimal of probably near-optimal solutions
• Benchmarking optimization software with performance profiles.

This page was built for publication: An algorithmic framework for convex mixed integer nonlinear programs