Analyzing the Pooling Problem

Published Online:https://doi.org/10.1287/ijoc.7.2.205

The pooling problem is a non-convex mathematical program that arises in blending materials to produce products, such as the blending of crude or refined petroleum. Each material has a set of attributes with associated qualities, such as percentage sulfur and octane rating. Pool qualities are determined by a flow-weighted average of the source qualities, and product qualities are similarly defined by a flow-weighted average of pool qualities. Product qualities are constrained to lie in specified ranges. The pooling problem is to minimize the total cost of flows, subject to flow and quality constraints. Present solution methods are based on sequential linear programming, and sensitivity analysis relies upon Lagrange multipliers. These methods are not exact and can lead to erroneous conclusions. A new method is presented that is based upon computational geometry, which provides exact answers to questions of sensitivity analysis and infeasibility diagnosis.

INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.