A new Lagrangean approach to the pooling problem
From MaRDI portal
Publication:1037357
DOI10.1007/s10898-008-9371-1zbMath1193.90189OpenAlexW1965468942MaRDI QIDQ1037357
Samir Elhedhli, Hossa Almutairi
Publication date: 16 November 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9371-1
Related Items (9)
Pooling problems with polynomial-time algorithms ⋮ Large-scale standard pooling problems with constrained pools and fixed demands ⋮ Strong formulations for the pooling problem ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ A cost minimization heuristic for the pooling problem ⋮ Relaxations and discretizations for the pooling problem ⋮ New multi-commodity flow formulations for the pooling problem ⋮ The computational complexity of the pooling problem ⋮ Feasibility and cost minimisation for a lithium extraction problem
Uses Software
Cites Work
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- A new reformulation-linearization technique for bilinear programming problems
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Global minimization by reducing the duality gap
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
- Pooling Problem: Alternate Formulations and Solution Methods
- Jointly Constrained Biconvex Programming
- Successive Linear Programming at Exxon
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- 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†
This page was built for publication: A new Lagrangean approach to the pooling problem
