Discretization and global optimization for mixed integer bilinear programming

DOI10.1007/s10898-022-01179-3zbMath1505.90083OpenAlexW4281980926MaRDI QIDQ2089882

Xin Cheng, Xiang Li

Publication date: 24 October 2022

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-022-01179-3

zbMATH Keywords

discretizationglobal optimizationMILP relaxationmixed integer bilinear programmingsharp formulation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Uses Software

• BARON
• SCIP
• Gurobi
• MINLP
• GAMS
• APOGEE

Cites Work

• APOGEE
• Global optimization of bilinear programs with a multiparametric disaggregation technique
• Relaxations and discretizations for the pooling problem
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Mixed-integer bilinear programming problems
• A new reformulation-linearization technique for bilinear programming problems
• A polyhedral branch-and-cut approach to global optimization
• Multi-parametric disaggregation technique for global optimization of polynomial programming problems
• Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
• Mixed Integer Linear Programming Formulation Techniques
• Solving Mixed Integer Bilinear Problems Using MILP Formulations
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Benchmarking optimization software with performance profiles.

This page was built for publication: Discretization and global optimization for mixed integer bilinear programming