A multi-commodity flow formulation for the generalized pooling problem

DOI10.1007/s10898-012-9890-7zbMath1272.90103MaRDI QIDQ2392115

Mohammed Alfaki, Dag Haugland

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

zbMATH Keywords

linear relaxation; pooling problem; multi-commodity flow; bilinear constraint; convex and concave envelopes

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

Related Items

Strong Convex Nonlinear Relaxations of the Pooling Problem, A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, 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, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, Global optimization of MIQCPs with dynamic piecewise relaxations, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, QPLIB: a library of quadratic programming instances

Uses Software

• BARON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Global minimization by reducing the duality gap
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• BARON: A general purpose global optimization software package
• Strong formulations for the pooling problem
• Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
• 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
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A bilinear approach to the pooling problem†
• Introduction to global optimization.