IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v32y1984i2p314-342.html
   My bibliography  Save this article

A Geometric Programming Model for the Optimal Design of Wastewater Treatment Plants

Author

Listed:
  • Yves Smeers

    (Center for Operations Research and Econometrics, Louvain-la-Neuve, Belgium)

  • Daniel Tyteca

    (Institut d'Administration et de Gestion, Louvain-la-Neuve, Belgium)

Abstract

We present a complete mathematical model describing the various interactions in a wastewater treatment plant. The optimal design of the plant is studied by first reformulating the model as a signomial program; this reformulation eases function and gradient evaluations as well as data manipulation, and allows the user to test and exploit the model in an interactive and repeated way. The model departs significantly from previous work in the area by introducing no ad hoc simplification in the constituting process models, nor in the optimization procedure. Since the model includes various nonconvexities due to signomial expressions, we tested convexifying procedures, which did not produce better solutions than those obtained from the model under its original signomial form. Application of the model is illustrated not only for design purposes, but also as a useful tool for generating various types of cost information required in regional water quality management models.

Suggested Citation

  • Yves Smeers & Daniel Tyteca, 1984. "A Geometric Programming Model for the Optimal Design of Wastewater Treatment Plants," Operations Research, INFORMS, vol. 32(2), pages 314-342, April.
    • Handle: RePEc:inm:oropre:v:32:y:1984:i:2:p:314-342
    DOI: 10.1287/opre.32.2.314
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.32.2.314
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.32.2.314?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
    ---><---

    Citations

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


    Cited by:

    1. Dennis L. Bricker & K. O. Kortanek, 2017. "Perfect Duality in Solving Geometric Programming Problems Under Uncertainty," Journal of Optimization Theory and Applications, Springer, vol. 173(3), pages 1055-1065, June.

    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:inm:oropre:v:32:y:1984:i:2:p:314-342. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.