Robust optimization for the pooling problem

Abstract

The pooling problem has applications, e.g., in petrochemical refining, water networks, and supply chains and is widely studied in global optimization. To date, it has largely been treated deterministically, neglecting the influence of parametric uncertainty. This paper applies two robust optimization approaches, reformulation and cutting planes, to the non-linear, non-convex pooling problem. Most applications of robust optimization have been either convex or mixed-integer linear problems. We explore the suitability of robust optimization in the context of global optimization problems which are concave in the uncertain parameters by considering the pooling problem with uncertain inlet concentrations. We compare the computational efficiency of reformulation and cutting plane approaches for three commonly-used uncertainty set geometries on 14 pooling problem instances and demonstrate how accounting for uncertainty changes the optimal solution.

References in corpus (5)

• A Practical Guide to Robust Optimization
• Exploiting Problem Structure in Optimization under Uncertainty via Online Convex Optimization
• Extending the Scope of Robust Quadratic Optimization
• On the convergence of cutting-plane methods for robust optimization with ellipsoidal uncertainty sets
• Data-driven optimization of processes with degrading equipment