Analyzing the Pooling Problem

DOI10.1287/IJOC.7.2.205MaRDI QIDQ4896448zbMATH OpenOpenAlexFDO

Authors 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

sensitivity analysisLagrange multiplierscomputational geometrypooling problemblendingsequential linear programmingnon-convex mathematical program

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Pooling problem: alternate formulations and solution methods
• Complexity analysis and algorithm design of pooling problem
• The computational complexity of the pooling problem
• Some results on pooling
• Pooling problems with polynomial-time algorithms
• A polynomially solvable case of the pooling problem
• A bilinear approach to the pooling problem†
• Analysis of MILP techniques for the pooling problem
• A new Lagrangean approach to the pooling problem

Cited in

(9)

• Unit-operation nonlinear modeling for planning and scheduling applications
• Some results on pooling
• Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization
• Using column generation to solve a coal blending problem
• Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
• A cost minimization heuristic for the pooling problem
• scientific article; zbMATH DE number 3993338 (Why is no real title available?)
• A decomposition-based heuristic for collaborative scheduling in a network of open-pit mines
• Relaxations and discretizations for the pooling problem

This page was built for publication: Analyzing the Pooling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896448)