Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
From MaRDI portal
Publication:280099
DOI10.1007/s10898-015-0342-zzbMath1346.90625OpenAlexW986230988MaRDI QIDQ280099
Publication date: 29 April 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0342-z
algorithmquadratic optimizationdisjunctive programmingmixed integer nonlinear programmingprocess networks
Related Items
Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems ⋮ Sequence of polyhedral relaxations for nonlinear univariate functions ⋮ The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems ⋮ Global optimization of MIQCPs with dynamic piecewise relaxations ⋮ Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming ⋮ Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique ⋮ An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs ⋮ Compact mixed-integer programming formulations in quadratic optimization
Uses Software
Cites Work
- GLOMIQO: global mixed-integer quadratic optimizer
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Test examples for nonlinear programming codes
- A new reformulation-linearization technique for bilinear programming problems
- Different transformations for solving non-convex trim-loss problems by MINLP
- Handbook of test problems in local and global optimization
- A polyhedral branch-and-cut approach to global optimization
- BARON: A general purpose global optimization software package
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Modelling with integer variables
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Disjunctive Programming
- CONOPT—A Large-Scale GRG Code
- Benchmarking optimization software with performance profiles.
