IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v67y2017i3d10.1007_s10898-016-0432-6.html
   My bibliography  Save this article

A polynomially solvable case of the pooling problem

Author

Listed:
  • Natashia Boland

    (Georgia Institute of Technology)

  • Thomas Kalinowski

    (The University of Newcastle)

  • Fabian Rigterink

    (The University of Newcastle)

Abstract

Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview of known complexity results and remaining open problems to further characterize the border between (strongly) NP-hard and polynomially solvable cases of the pooling problem.

Suggested Citation

  • Natashia Boland & Thomas Kalinowski & Fabian Rigterink, 2017. "A polynomially solvable case of the pooling problem," Journal of Global Optimization, Springer, vol. 67(3), pages 621-630, March.
    • Handle: RePEc:spr:jglopt:v:67:y:2017:i:3:d:10.1007_s10898-016-0432-6
    DOI: 10.1007/s10898-016-0432-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-016-0432-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-016-0432-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Santanu S. Dey & Akshay Gupte, 2015. "Analysis of MILP Techniques for the Pooling Problem," Operations Research, INFORMS, vol. 63(2), pages 412-427, April.
    2. Charles Audet & Jack Brimberg & Pierre Hansen & Sébastien Le Digabel & Nenad Mladenovi'{c}, 2004. "Pooling Problem: Alternate Formulations and Solution Methods," Management Science, INFORMS, vol. 50(6), pages 761-776, June.
    3. Calvin W. DeWitt & Leon S. Lasdon & Allan D. Waren & Donald A. Brenner & Simon A. Melhem, 1989. "OMEGA: An Improved Gasoline Blending System for Texaco," Interfaces, INFORMS, vol. 19(1), pages 85-101, February.
    4. Dag Haugland & Eligius M. T. Hendrix, 2016. "Pooling Problems with Polynomial-Time Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 591-615, August.
    5. Mohammed Alfaki & Dag Haugland, 2013. "A multi-commodity flow formulation for the generalized pooling problem," Journal of Global Optimization, Springer, vol. 56(3), pages 917-937, July.
    6. Billy Rigby & Leon S. Lasdon & Allan D. Waren, 1995. "The Evolution of Texaco’s Blending Systems: From OMEGA to StarBlend," Interfaces, INFORMS, vol. 25(5), pages 64-83, October.
    7. Natashia Boland & Thomas Kalinowski & Fabian Rigterink, 2016. "New multi-commodity flow formulations for the pooling problem," Journal of Global Optimization, Springer, vol. 66(4), pages 669-710, December.
    8. Mohammed Alfaki & Dag Haugland, 2013. "Strong formulations for the pooling problem," Journal of Global Optimization, Springer, vol. 56(3), pages 897-916, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Radu Baltean-Lugojan & Ruth Misener, 2018. "Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness," Journal of Global Optimization, Springer, vol. 71(4), pages 655-690, August.
    2. Santanu S. Dey & Burak Kocuk & Asteroide Santana, 2020. "Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem," Journal of Global Optimization, Springer, vol. 77(2), pages 227-272, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Radu Baltean-Lugojan & Ruth Misener, 2018. "Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness," Journal of Global Optimization, Springer, vol. 71(4), pages 655-690, August.
    2. Mohammed Alfaki & Dag Haugland, 2014. "A cost minimization heuristic for the pooling problem," Annals of Operations Research, Springer, vol. 222(1), pages 73-87, November.
    3. Dag Haugland & Eligius M. T. Hendrix, 2016. "Pooling Problems with Polynomial-Time Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 591-615, August.
    4. Natashia Boland & Thomas Kalinowski & Fabian Rigterink, 2016. "New multi-commodity flow formulations for the pooling problem," Journal of Global Optimization, Springer, vol. 66(4), pages 669-710, December.
    5. Santanu S. Dey & Burak Kocuk & Asteroide Santana, 2020. "Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem," Journal of Global Optimization, Springer, vol. 77(2), pages 227-272, June.
    6. Ted Kutz & Mark Davis & Robert Creek & Nick Kenaston & Craig Stenstrom & Margery Connor, 2014. "Optimizing Chevron’s Refineries," Interfaces, INFORMS, vol. 44(1), pages 39-54, February.
    7. Ahmadreza Marandi & Joachim Dahl & Etienne Klerk, 2018. "A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem," Annals of Operations Research, Springer, vol. 265(1), pages 67-92, June.
    8. Kazda, Kody & Li, Xiang, 2024. "A linear programming approach to difference-of-convex piecewise linear approximation," European Journal of Operational Research, Elsevier, vol. 312(2), pages 493-511.
    9. Marandi, Ahmadreza & Dahl, Joachim & de Klerk, Etienne, 2018. "A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem," Other publications TiSEM 981f1428-4d42-4d3f-9a7a-7, Tilburg University, School of Economics and Management.
    10. Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.
    11. Akshay Gupte & Shabbir Ahmed & Santanu S. Dey & Myun Seok Cheon, 2017. "Relaxations and discretizations for the pooling problem," Journal of Global Optimization, Springer, vol. 67(3), pages 631-669, March.
    12. Dimitri J. Papageorgiou & Alejandro Toriello & George L. Nemhauser & Martin W. P. Savelsbergh, 2012. "Fixed-Charge Transportation with Product Blending," Transportation Science, INFORMS, vol. 46(2), pages 281-295, May.
    13. Ríos-Mercado, Roger Z. & Borraz-Sánchez, Conrado, 2015. "Optimization problems in natural gas transportation systems: A state-of-the-art review," Applied Energy, Elsevier, vol. 147(C), pages 536-555.
    14. Santanu S. Dey & Akshay Gupte, 2015. "Analysis of MILP Techniques for the Pooling Problem," Operations Research, INFORMS, vol. 63(2), pages 412-427, April.
    15. Chang, Jiyoun C. & Graves, Stephen C. & Kirchain, Randolph E. & Olivetti, Elsa A., 2019. "Integrated planning for design and production in two-stage recycling operations," European Journal of Operational Research, Elsevier, vol. 273(2), pages 535-547.
    16. Fischetti, Matteo & Monaci, Michele, 2020. "A branch-and-cut algorithm for Mixed-Integer Bilinear Programming," European Journal of Operational Research, Elsevier, vol. 282(2), pages 506-514.
    17. Yifu Chen & Christos T. Maravelias, 2022. "Variable Bound Tightening and Valid Constraints for Multiperiod Blending," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2073-2090, July.
    18. Boukouvala, Fani & Misener, Ruth & Floudas, Christodoulos A., 2016. "Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO," European Journal of Operational Research, Elsevier, vol. 252(3), pages 701-727.
    19. Wu, Di & Liu, Xiang-dong & Yan, Xiang-bin & Peng, Rui & Li, Gang, 2019. "Equilibrium analysis of bitcoin block withholding attack: A generalized model," Reliability Engineering and System Safety, Elsevier, vol. 185(C), pages 318-328.
    20. Uday S. Karmarkar & Kumar Rajaram, 2001. "Grade Selection and Blending to Optimize Cost and Quality," Operations Research, INFORMS, vol. 49(2), pages 271-280, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:67:y:2017:i:3:d:10.1007_s10898-016-0432-6. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.