IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v305y2023i2p547-561.html
   My bibliography  Save this article

Approximating a linear multiplicative objective in watershed management optimization

Author

Listed:
  • Boddiford, Ashley N.
  • Kaufman, Daniel E.
  • Skipper, Daphne E.
  • Uhan, Nelson A.

Abstract

Implementing management practices in a cost-efficient manner is critical for regional efforts to reduce the amount of pollutants entering the Chesapeake Bay. We study the problem of selecting a subset of practices that minimizes pollutant load—subject to budgetary and environmental constraints—as simulated in a widely used regulatory watershed model. Mimicking the computation of pollutant load in the regulatory model, we formulate this problem as a continuous optimization model with a linear multiplicative objective function and linear constraints. To lay the groundwork for incorporating additional stakeholder requirements in the future, especially those that would require integer variables, we present and study a continuous linear optimization model that approximates the nonlinear model. The linear model, which requires an exponential number of variables, arises naturally as an alternative model for the same underlying physical process. We examine the theoretical behavior of these optimization models and investigate restrictions of the linear model to handle its large number of variables. Through extensive computational tests on real and randomly generated instances, we demonstrate that the linear model and its restrictions provide optimal solutions close to those of the nonlinear model in practice, despite poor approximation properties in the worst case. We conclude that the linear model—together with our approach to handling its large number of variables—provides a viable framework from which to extend the optimization model to better meet the needs of the Chesapeake Bay watershed management stakeholders.

Suggested Citation

  • Boddiford, Ashley N. & Kaufman, Daniel E. & Skipper, Daphne E. & Uhan, Nelson A., 2023. "Approximating a linear multiplicative objective in watershed management optimization," European Journal of Operational Research, Elsevier, vol. 305(2), pages 547-561.
  • Handle: RePEc:eee:ejores:v:305:y:2023:i:2:p:547-561
    DOI: 10.1016/j.ejor.2022.06.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722004623
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2022.06.006?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. Xu, Hui & Brown, Daniel G. & Moore, Michael R. & Currie, William S., 2018. "Optimizing Spatial Land Management to Balance Water Quality and Economic Returns in a Lake Erie Watershed," Ecological Economics, Elsevier, vol. 145(C), pages 104-114.
    2. Hood, Raleigh R. & Shenk, Gary W. & Dixon, Rachel L. & Smith, Sean M.C. & Ball, William P. & Bash, Jesse O. & Batiuk, Rich & Boomer, Kathy & Brady, Damian C. & Cerco, Carl & Claggett, Peter & de Mutse, 2021. "The Chesapeake Bay program modeling system: Overview and recommendations for future development," Ecological Modelling, Elsevier, vol. 456(C).
    3. Maranas, C. D. & Androulakis, I. P. & Floudas, C. A. & Berger, A. J. & Mulvey, J. M., 1997. "Solving long-term financial planning problems via global optimization," Journal of Economic Dynamics and Control, Elsevier, vol. 21(8-9), pages 1405-1425, June.
    4. Daniele Depetrini & Marco Locatelli, 2009. "A FPTAS for a class of linear multiplicative problems," Computational Optimization and Applications, Springer, vol. 44(2), pages 275-288, November.
    5. Arthur M. Geoffrion, 1967. "Solving Bicriterion Mathematical Programs," Operations Research, INFORMS, vol. 15(1), pages 39-54, February.
    6. H. P. Benson & G. M. Boger, 2000. "Outcome-Space Cutting-Plane Algorithm for Linear Multiplicative Programming," Journal of Optimization Theory and Applications, Springer, vol. 104(2), pages 301-322, February.
    7. John M. Mulvey & Robert J. Vanderbei & Stavros A. Zenios, 1995. "Robust Optimization of Large-Scale Systems," Operations Research, INFORMS, vol. 43(2), pages 264-281, April.
    Full references (including those not matched with items on IDEAS)

    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. Gao, YueLin & Zhang, Bo, 2023. "Output-space branch-and-bound reduction algorithm for generalized linear fractional-multiplicative programming problem," Chaos, Solitons & Fractals, Elsevier, vol. 175(P1).
    2. Peiping Shen & Kaimin Wang & Ting Lu, 2020. "Outer space branch and bound algorithm for solving linear multiplicative programming problems," Journal of Global Optimization, Springer, vol. 78(3), pages 453-482, November.
    3. Yunchol Jong & Yongjin Kim & Hyonchol Kim, 2024. "A method based on parametric convex programming for solving convex multiplicative programming problem," Journal of Global Optimization, Springer, vol. 90(3), pages 573-592, November.
    4. Lizhen Shao & Matthias Ehrgott, 2014. "An objective space cut and bound algorithm for convex multiplicative programmes," Journal of Global Optimization, Springer, vol. 58(4), pages 711-728, April.
    5. Bo Zhang & Hongyu Wang & Yuelin Gao, 2024. "Output-Space Outer Approximation Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programs," Journal of Optimization Theory and Applications, Springer, vol. 202(3), pages 997-1026, September.
    6. Peiping Shen & Dianxiao Wu & Kaimin Wang, 2023. "Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound," Journal of Global Optimization, Springer, vol. 86(2), pages 303-321, June.
    7. Bo Zhang & Yuelin Gao & Xia Liu & Xiaoli Huang, 2020. "Output-Space Branch-and-Bound Reduction Algorithm for a Class of Linear Multiplicative Programs," Mathematics, MDPI, vol. 8(3), pages 1-34, March.
    8. Donghai Wang & Qiuhong Zhao, 2020. "A Simultaneous Optimization Model for Airport Network Slot Allocation under Uncertain Capacity," Sustainability, MDPI, vol. 12(14), pages 1-14, July.
    9. Shan Lan & John-Paul Clarke & Cynthia Barnhart, 2006. "Planning for Robust Airline Operations: Optimizing Aircraft Routings and Flight Departure Times to Minimize Passenger Disruptions," Transportation Science, INFORMS, vol. 40(1), pages 15-28, February.
    10. Khaled, Oumaima & Minoux, Michel & Mousseau, Vincent & Michel, Stéphane & Ceugniet, Xavier, 2018. "A multi-criteria repair/recovery framework for the tail assignment problem in airlines," Journal of Air Transport Management, Elsevier, vol. 68(C), pages 137-151.
    11. Irawan, Chandra Ade & Jones, Dylan & Hofman, Peter S. & Zhang, Lina, 2023. "Integrated strategic energy mix and energy generation planning with multiple sustainability criteria and hierarchical stakeholders," European Journal of Operational Research, Elsevier, vol. 308(2), pages 864-883.
    12. Hashem Omrani & Farzane Adabi & Narges Adabi, 2017. "Designing an efficient supply chain network with uncertain data: a robust optimization—data envelopment analysis approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(7), pages 816-828, July.
    13. Hongwei Jiao & Binbin Li & Wenqiang Yang, 2024. "A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems," Journal of Global Optimization, Springer, vol. 89(3), pages 597-632, July.
    14. Jihee Han & KwangSup Shin, 2016. "Evaluation mechanism for structural robustness of supply chain considering disruption propagation," International Journal of Production Research, Taylor & Francis Journals, vol. 54(1), pages 135-151, January.
    15. Tsai, Jung-Fa, 2007. "An optimization approach for supply chain management models with quantity discount policy," European Journal of Operational Research, Elsevier, vol. 177(2), pages 982-994, March.
    16. Xuejie Bai & Yankui Liu, 2016. "Robust optimization of supply chain network design in fuzzy decision system," Journal of Intelligent Manufacturing, Springer, vol. 27(6), pages 1131-1149, December.
    17. Min Liu & Jianpeng Fan & Yuanzheng Li & Qizheng Mao, 2023. "Ecosystem Service Optimisation in the Central Plains Urban Agglomeration Based on Land Use Structure Adjustment," Land, MDPI, vol. 12(7), pages 1-27, July.
    18. Schönlein, Michael & Makuschewitz, Thomas & Wirth, Fabian & Scholz-Reiter, Bernd, 2013. "Measurement and optimization of robust stability of multiclass queueing networks: Applications in dynamic supply chains," European Journal of Operational Research, Elsevier, vol. 229(1), pages 179-189.
    19. Antonio G. Martín & Manuel Díaz-Madroñero & Josefa Mula, 2020. "Master production schedule using robust optimization approaches in an automobile second-tier supplier," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 143-166, March.
    20. Sebastian Rachuba & Brigitte Werners, 2017. "A fuzzy multi-criteria approach for robust operating room schedules," Annals of Operations Research, Springer, vol. 251(1), pages 325-350, 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:eee:ejores:v:305:y:2023:i:2:p:547-561. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.