A cost minimization heuristic for the pooling problem

DOI10.1007/S10479-013-1433-1MaRDI QIDQ490199zbMATH OpenOpenAlexFDO

Authors Mohammed Alfaki, Dag Haugland

Publication date 22 January 2015

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-013-1433-1

zbMATH Keywords

network optimizationpooling problemheuristic methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Recommendations

• Pooling problem: alternate formulations and solution methods
• Complexity analysis and algorithm design of pooling problem
• The computational complexity of the pooling problem
• Analyzing the Pooling Problem
• A multi-commodity flow formulation for the generalized pooling problem

Cites work

• A Decomposition Strategy for Global Optimum Search in the Pooling Problem
• A bilinear approach to the pooling problem†
• A multi-commodity flow formulation for the generalized pooling problem
• A new Lagrangean approach to the pooling problem
• A nonlinear programming technique for the optimization of continuous processing systems
• A polyhedral branch-and-cut approach to global optimization
• A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A simple SLP algorithm for solving a class of nonlinear programs
• An Improved Successive Linear Programming Algorithm
• An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
• Comparison of discrete and continuous models for the pooling problem
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Global minimization by reducing the duality gap
• Modelling the pooling problem at the New Zealand Refining Company
• Nonlinear Optimization by Successive Linear Programming
• Optimization Models for the Natural Gas Value Chain
• Pooling problem: alternate formulations and solution methods
• Strong formulations for the pooling problem
• Successive Linear Programming at Exxon

Cited in

(6)

• New multi-commodity flow formulations for the pooling problem
• The computational complexity of the pooling problem
• A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem
• Feasibility and cost minimisation for a lithium extraction problem
• Relaxations and discretizations for the pooling problem
• Analysis of MILP techniques for the pooling problem

Describes a project that uses

Uses Software

• SINTEF

This page was built for publication: A cost minimization heuristic for the pooling problem

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