Analyzing the Pooling Problem

DOI10.1287/ijoc.7.2.205zbMath0859.90103OpenAlexW2116990741MaRDI QIDQ4896448

Harvey J. Greenberg

Publication date: 15 April 1997

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

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

zbMATH Keywords

Lagrange multiplierssensitivity analysiscomputational geometryblendingpooling problemsequential linear programmingnon-convex mathematical program

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (5)

Unit-operation nonlinear modeling for planning and scheduling applications ⋮ A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines ⋮ Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization ⋮ Relaxations and discretizations for the pooling problem ⋮ Using Column Generation to Solve a Coal Blending Problem

This page was built for publication: Analyzing the Pooling Problem