IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v335y2026i1p166-176.html

A new framework for simulation-based goal programming using retrospective optimization

Author

Listed:
  • Tsai, Shing Chih
  • Lu, Hao-Chun
  • Wang, Honggang

Abstract

In this paper, we present a simulation-based goal programming framework to address stochastic optimization problems involving multiple performance measures. We specifically consider the weighted goal programming and min–max goal programming formulations, which are widely used in the field of goal programming. Due to the analytical intractability of the objective functions in this stochastic optimization model, traditional mathematical programming techniques cannot be readily applicable. To overcome this challenge, we propose using retrospective optimization algorithms, a type of simulation–optimization approach. To establish the validity of our method, we provide a convergence analysis of the proposed algorithms, demonstrating their ability to converge to a globally optimal solution under specific conditions. In addition to the theoretical development, we conduct numerical experiments using benchmark test functions and a stochastic inventory optimization problem to illustrate the effectiveness of our framework. The empirical results demonstrate that our approach performs competitively compared to existing benchmark solution methods.

Suggested Citation

  • Tsai, Shing Chih & Lu, Hao-Chun & Wang, Honggang, 2026. "A new framework for simulation-based goal programming using retrospective optimization," European Journal of Operational Research, Elsevier, vol. 335(1), pages 166-176.
  • Handle: RePEc:eee:ejores:v:335:y:2026:i:1:p:166-176
    DOI: 10.1016/j.ejor.2026.05.031
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2026.05.031?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:335:y:2026:i:1:p:166-176. 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: 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.