Strong Convex Nonlinear Relaxations of the Pooling Problem
From MaRDI portal
Publication:5114398
DOI10.1137/18M1174374zbMath1445.90088arXiv1803.02955OpenAlexW2793637818MaRDI QIDQ5114398
Jeff Linderoth, Jonas Schweiger, Claudia D'Ambrosio, James R. Luedtke
Publication date: 22 June 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.02955
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
Tightening methods based on nontrivial bounds on bilinear terms, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, (Global) optimization: historical notes and recent developments, Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms
Uses Software
Cites Work
- Unnamed Item
- A polynomially solvable case of the pooling problem
- Relaxations and discretizations for the pooling problem
- New multi-commodity flow formulations for the pooling problem
- Global minimization by reducing the duality gap
- Deriving convex hulls through lifting and projection
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- Large-scale standard pooling problems with constrained pools and fixed demands
- A multi-commodity flow formulation for the generalized pooling problem
- Strong formulations for the pooling problem
- Valid Inequalities for the Pooling Problem with Binary Variables
- Pooling Problem: Alternate Formulations and Solution Methods
- Analysis of MILP Techniques for the Pooling Problem
- Successive Linear Programming at Exxon
- A Decomposition Strategy for Global Optimum Search in the Pooling Problem
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A bilinear approach to the pooling problem†
- The computational complexity of the pooling problem
