Relaxations and discretizations for the pooling problem
From MaRDI portal
Publication:513173
DOI10.1007/s10898-016-0434-4zbMath1392.90117OpenAlexW2344092458MaRDI QIDQ513173
Myun Seok Cheon, Santanu S. Dey, Akshay Gupte, Shabbir Ahmed
Publication date: 3 March 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://tigerprints.clemson.edu/mathematics_pubs/3
Related Items (28)
Analysis of MILP Techniques for the Pooling Problem ⋮ Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems ⋮ A matheuristic approach for optimizing mineral value chains under uncertainty ⋮ A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem ⋮ LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization ⋮ Tightening methods based on nontrivial bounds on bilinear terms ⋮ Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ A Bayesian framework for molecular strain identification from mixed diagnostic samples ⋮ Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization ⋮ Stochastic dual dynamic integer programming ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ Variable Bound Tightening and Valid Constraints for Multiperiod Blending ⋮ Robust multicriteria risk-averse stochastic programming models ⋮ Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms ⋮ Shortest Paths in Graphs of Convex Sets ⋮ Strong Convex Nonlinear Relaxations of the Pooling Problem ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem ⋮ A polynomially solvable case of the pooling problem ⋮ New multi-commodity flow formulations for the pooling problem ⋮ Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods ⋮ A branch-and-cut algorithm for mixed-integer bilinear programming ⋮ Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy ⋮ Extended formulations for convex hulls of some bilinear functions ⋮ New SOCP relaxation and branching rule for bipartite bilinear programs ⋮ Discretization and global optimization for mixed integer bilinear programming ⋮ Special issue: Global solution of integer, stochastic and nonconvex optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A cost minimization heuristic for the pooling problem
- New multi-commodity flow formulations for the pooling problem
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- Concave extensions for nonlinear 0-1 maximization problems
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Solving planning and design problems in the process industry using mixed integer and global optimization
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- Existence and sum decomposition of vertex polyhedral convex envelopes
- A new Lagrangean approach to the pooling problem
- Global minimization by reducing the duality gap
- A convex envelope formula for multilinear functions
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Some results on the strength of relaxations of multilinear functions
- Decomposition strategy for the stochastic 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
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Solving Mixed Integer Bilinear Problems Using MILP Formulations
- The MILP Road to MIQCP
- A Polytope for a Product of Real Linear Functions in 0/1 Variables
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Valid Inequalities for the Pooling Problem with Binary Variables
- Pooling Problem: Alternate Formulations and Solution Methods
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Analysis of MILP Techniques for the Pooling Problem
- Jointly Constrained Biconvex Programming
- The cutting stock problem and integer rounding
- 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†
- Analyzing the Pooling Problem
- Mixed-integer nonlinear optimization
This page was built for publication: Relaxations and discretizations for the pooling problem
