# Decomposition strategy for the stochastic pooling problem

## Author Info

• Xiang Li
• Asgeir Tomasgard
• Paul Barton

()

Registered author(s):

## Abstract

The stochastic pooling problem is a type of stochastic mixed-integer bilinear program arising in the integrated design and operation of various important industrial networks, such as gasoline blending, natural gas production and transportation, water treatment, etc. This paper presents a rigorous decomposition method for the stochastic pooling problem, which guarantees finding an $${\epsilon}$$ -optimal solution with a finite number of iterations. By convexification of the bilinear terms, the stochastic pooling problem is relaxed into a lower bounding problem that is a potentially large-scale mixed-integer linear program (MILP). Solution of this lower bounding problem is then decomposed into a sequence of relaxed master problems, which are MILPs with much smaller sizes, and primal bounding problems, which are linear programs. The solutions of the relaxed master problems yield a sequence of nondecreasing lower bounds on the optimal objective value, and they also generate a sequence of integer realizations defining the primal problems which yield a sequence of nonincreasing upper bounds on the optimal objective value. The decomposition algorithm terminates finitely when the lower and upper bounds coincide (or are close enough), or infeasibility of the problem is indicated. Case studies involving two example problems and two industrial problems demonstrate the dramatic computational advantage of the proposed decomposition method over both a state-of-the-art branch-and-reduce global optimization method and explicit enumeration of integer realizations, particularly for large-scale problems. Copyright Springer Science+Business Media, LLC. 2012

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://hdl.handle.net/10.1007/s10898-011-9792-0

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

## Bibliographic Info

Article provided by Springer in its journal Journal of Global Optimization.

Volume (Year): 54 (2012)
Issue (Month): 4 (December)
Pages: 765-790

as in new window
Handle: RePEc:spr:jglopt:v:54:y:2012:i:4:p:765-790

Contact details of provider:

Order Information:

## Related research

Keywords: Nonconvex mixed-integer nonlinear programming; Stochastic programming; Stochastic pooling problem; Decomposition; Large-scale; 90C26; 90C15;

Find related papers by JEL classification:

• 90C - - - - - -
• 90C - - - - - -

## References

No references listed on IDEAS
You can help add them by filling out this form.

## Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

## Corrections

When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:54:y:2012:i:4:p:765-790. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.