IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v89y2024i2d10.1007_s10898-023-01363-z.html
   My bibliography  Save this article

A strong P-formulation for global optimization of industrial water-using and treatment networks

Author

Listed:
  • Xin Cheng

    (Queen’s University)

  • Xiang Li

    (Queen’s University
    Zhejiang University)

Abstract

The problem of finding the optimal flow allocation within an industrial water-using and treatment network can be formulated into nonconvex nonlinear program or nonconvex mixed-integer nonlinear program. The efficiency of global optimization of the nonconvex program relies heavily on the strength of the problem formulation. In this paper, we propose a variant of the commonly used P-formulation, called the P $$^*$$ ∗ -formulation, for the water treatment network (WTN) and the total water network (TWN) that includes water-using and water treatment units. For either type of networks, we prove that the P $$^*$$ ∗ -formulation is at least as strong as the P-formulation under mild bound consistency conditions. We also prove for either type of networks that the P $$^*$$ ∗ -formulation is at least as strong as the split-fraction based formulation (called SF-formulation) under certain bound consistency conditions. The computational study shows that the P $$^*$$ ∗ -formulation significantly outperforms the P- and the SF-formulations. For some problem instances, the P $$^*$$ ∗ -formulation is faster than the other two formulations by several orders of magnitudes.

Suggested Citation

  • Xin Cheng & Xiang Li, 2024. "A strong P-formulation for global optimization of industrial water-using and treatment networks," Journal of Global Optimization, Springer, vol. 89(2), pages 477-507, June.
  • Handle: RePEc:spr:jglopt:v:89:y:2024:i:2:d:10.1007_s10898-023-01363-z
    DOI: 10.1007/s10898-023-01363-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-023-01363-z
    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-023-01363-z?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.

    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:89:y:2024:i:2:d:10.1007_s10898-023-01363-z. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.