Strong formulations for the pooling problem
From MaRDI portal
Publication:2392127
DOI10.1007/s10898-012-9875-6zbMath1272.90054MaRDI QIDQ2392127
Publication date: 1 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1956/5847
computational complexity; global optimization; bilinear programming; linear relaxation; pooling problem
90C60: Abstract computational complexity for mathematical programming problems
90C26: Nonconvex programming, global optimization
Related Items
Variable Bound Tightening and Valid Constraints for Multiperiod Blending, Strong Convex Nonlinear Relaxations of the Pooling Problem, The Convex Hull of a Quadratic Constraint over a Polytope, The computational complexity of the pooling problem, A linear programming approach to difference-of-convex piecewise linear approximation, Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms, A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints, Pooling problems with polynomial-time algorithms, A cost minimization heuristic for the pooling problem, A polynomially solvable case of the pooling problem, Relaxations and discretizations for the pooling problem, New multi-commodity flow formulations for the pooling problem, A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem, Complexity analysis and algorithm design of pooling problem, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods, Convex hull representations for bounded products of variables, Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems, Tightening methods based on nontrivial bounds on bilinear terms, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, Complementarity-based nonlinear programming techniques for optimal mixing in gas networks, Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy, Large-scale standard pooling problems with constrained pools and fixed demands, A multi-commodity flow formulation for the generalized pooling problem, Analysis of MILP Techniques for the Pooling Problem
Uses Software
Cites Work
- Unnamed Item
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- A new Lagrangean approach to the pooling problem
- A simple SLP algorithm for solving a class of nonlinear programs
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Global minimization by reducing the duality gap
- A finite algorithm for global minimization of separable concave programs
- BARON: A general purpose global optimization software package
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- Pooling Problem: Alternate Formulations and Solution Methods
- Jointly Constrained Biconvex Programming
- An Improved Successive Linear Programming Algorithm
- 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†
- Nonlinear Optimization by Successive Linear Programming
