A Decomposition Strategy for Global Optimum Search in the Pooling Problem

DOI10.1287/IJOC.2.3.225zbMath0755.90091OpenAlexW2127611252MaRDI QIDQ4025917

Christodoulos A. Floudas, Avanish Aggarwal

Publication date: 18 February 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2.3.225

zbMATH Keywords

decompositionglobal optimumpooling problemnonconvex nonlinear relationshipspetrochemical processes

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (20)

Natural gas production network infrastructure development under uncertainty ⋮ A relaxation method for nonconvex quadratically constrained quadratic programs ⋮ Optimal crude oil procurement under fluctuating price in an oil refinery ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ A decomposition approach for global optimum search in QP, NLP and MINLP problems ⋮ Partly convex programming and Zermelo's navigation problems ⋮ Strong formulations for the pooling problem ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ Strong Convex Nonlinear Relaxations of the Pooling Problem ⋮ A cost minimization heuristic for the pooling problem ⋮ Relaxations and discretizations for the pooling problem ⋮ A global supply chain model with transfer pricing and transportation cost allocation ⋮ Convergence and application of a decomposition method using duality bounds for nonconvex global optimization ⋮ Feasibility and cost minimisation for a lithium extraction problem ⋮ A new Lagrangean approach to the pooling problem ⋮ New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints ⋮ Global minimization by reducing the duality gap ⋮ Solving planning and design problems in the process industry using mixed integer and global optimization

Uses Software

• GAMS

This page was built for publication: A Decomposition Strategy for Global Optimum Search in the Pooling Problem