Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
type: Item
instance of: scholarly article
title: Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
zbMATH Open document ID: 1298.90058
author: Pedro M. Castro
author: Ignacio E. Grossmann
published in: Journal of Global Optimization
publication date: 2014-07-04T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6313381
zbMATH Keywords: global optimization
zbMATH Keywords: mixed integer nonlinear programming
zbMATH Keywords: mixed integer linear programming
zbMATH Keywords: scheduling
zbMATH Keywords: hydroelectric system
describes a project that uses: GloMIQO
describes a project that uses: APOGEE
MaRDI profile type: MaRDI publication profile
full work available at URL: s10898-014-0162-6
OpenAlex ID: W2070105389
cites work: Risk-averse profit-based optimal scheduling of a hydro-chain in the day-ahead electricity market
cites work: Complex nonlinear dynamics and controlling chaos in a Cournot duopoly economic model
cites work: Different transformations for solving non-convex trim-loss problems by MINLP
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: A branch-and-reduce approach to global optimization
cites work: GLOMIQO: global mixed-integer quadratic optimizer
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: Global optimization of bilinear programs with a multiparametric disaggregation technique
cites work: Univariate parameterization for global optimization of mixed-integer polynomial problems
cites work: Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
cites work: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
cites work: A new reformulation-linearization technique for bilinear programming problems
cites work: An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
cites work: Multi-parametric disaggregation technique for global optimization of polynomial programming problems
cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
cites work: Disjunctive Programming
cites work: Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
DOI: 10.1007/S10898-014-0162-6
Recommended article: Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
Recommended article: Global optimization of bilinear programs with a multiparametric disaggregation technique
Recommended article: Discretization and global optimization for mixed integer bilinear programming
Recommended article: Univariate parameterization for global optimization of mixed-integer polynomial problems
Recommended article: Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
description: scientific article; zbMATH DE number 6313381