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

Robust optimization approximation for joint chance constrained optimization problem

Author

Listed:
  • Yuan Yuan

    (University of Alberta)

  • Zukui Li

    (University of Alberta)

  • Biao Huang

    (University of Alberta)

Abstract

Chance constraint is widely used for modeling solution reliability in optimization problems with uncertainty. Due to the difficulties in checking the feasibility of the probabilistic constraint and the non-convexity of the feasible region, chance constrained problems are generally solved through approximations. Joint chance constrained problem enforces that several constraints are satisfied simultaneously and it is more complicated than individual chance constrained problem. This work investigates the tractable robust optimization approximation framework for solving the joint chance constrained problem. Various robust counterpart optimization formulations are derived based on different types of uncertainty set. To improve the quality of robust optimization approximation, a two-layer algorithm is proposed. The inner layer optimizes over the size of the uncertainty set, and the outer layer optimizes over the parameter t which is used for the indicator function upper bounding. Numerical studies demonstrate that the proposed method can lead to solutions close to the true solution of a joint chance constrained problem.

Suggested Citation

  • Yuan Yuan & Zukui Li & Biao Huang, 2017. "Robust optimization approximation for joint chance constrained optimization problem," Journal of Global Optimization, Springer, vol. 67(4), pages 805-827, April.
    • Handle: RePEc:spr:jglopt:v:67:y:2017:i:4:d:10.1007_s10898-016-0438-0
    DOI: 10.1007/s10898-016-0438-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-016-0438-0
    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-0438-0?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. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    2. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    3. L. Jeff Hong & Yi Yang & Liwei Zhang, 2011. "Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach," Operations Research, INFORMS, vol. 59(3), pages 617-630, June.
    4. ,, 2000. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 16(2), pages 287-299, April.
    5. A. Charnes & W. W. Cooper & G. H. Symonds, 1958. "Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil," Management Science, INFORMS, vol. 4(3), pages 235-263, April.
    6. A. L. Soyster, 1973. "Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming," Operations Research, INFORMS, vol. 21(5), pages 1154-1157, October.
    7. Wenqing Chen & Melvyn Sim, 2009. "Goal-Driven Optimization," Operations Research, INFORMS, vol. 57(2), pages 342-357, April.
    8. B. K. Pagnoncelli & S. Ahmed & A. Shapiro, 2009. "Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 399-416, August.
    9. Júlíus Atlason & Marina A. Epelman & Shane G. Henderson, 2008. "Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods," Management Science, INFORMS, vol. 54(2), pages 295-309, February.
    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. Sun, Yimeng & Qiu, Ruozhen & Sun, Minghe, 2024. "A robust optimization approach for inventory management with limited-time discounts and service-level requirement under demand uncertainty," International Journal of Production Economics, Elsevier, vol. 267(C).
    2. Zhouchun Huang & Qipeng Phil Zheng & Eduardo Pasiliao & Vladimir Boginski & Tao Zhang, 2019. "A cutting plane method for risk-constrained traveling salesman problem with random arc costs," Journal of Global Optimization, Springer, vol. 74(4), pages 839-859, August.

    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. L. Jeff Hong & Zhaolin Hu & Liwei Zhang, 2014. "Conditional Value-at-Risk Approximation to Value-at-Risk Constrained Programs: A Remedy via Monte Carlo," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 385-400, May.
    2. Shao-Wei Lam & Tsan Sheng Ng & Melvyn Sim & Jin-Hwa Song, 2013. "Multiple Objectives Satisficing Under Uncertainty," Operations Research, INFORMS, vol. 61(1), pages 214-227, February.
    3. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    4. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    5. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    6. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    7. Roos, Ernst & den Hertog, Dick, 2019. "Reducing conservatism in robust optimization," Other publications TiSEM ad0238cd-de7a-4366-b487-b, Tilburg University, School of Economics and Management.
    8. Wang, Tingsong & Meng, Qiang & Wang, Shuaian & Tan, Zhijia, 2013. "Risk management in liner ship fleet deployment: A joint chance constrained programming model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 1-12.
    9. Algo Carè & Simone Garatti & Marco C. Campi, 2014. "FAST---Fast Algorithm for the Scenario Technique," Operations Research, INFORMS, vol. 62(3), pages 662-671, June.
    10. Marla, Lavanya & Rikun, Alexander & Stauffer, Gautier & Pratsini, Eleni, 2020. "Robust modeling and planning: Insights from three industrial applications," Operations Research Perspectives, Elsevier, vol. 7(C).
    11. L. Jeff Hong & Yi Yang & Liwei Zhang, 2011. "Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach," Operations Research, INFORMS, vol. 59(3), pages 617-630, June.
    12. Liu, Kanglin & Li, Qiaofeng & Zhang, Zhi-Hai, 2019. "Distributionally robust optimization of an emergency medical service station location and sizing problem with joint chance constraints," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 79-101.
    13. Grani A. Hanasusanto & Vladimir Roitch & Daniel Kuhn & Wolfram Wiesemann, 2017. "Ambiguous Joint Chance Constraints Under Mean and Dispersion Information," Operations Research, INFORMS, vol. 65(3), pages 751-767, June.
    14. Nicholas G. Hall & Daniel Zhuoyu Long & Jin Qi & Melvyn Sim, 2015. "Managing Underperformance Risk in Project Portfolio Selection," Operations Research, INFORMS, vol. 63(3), pages 660-675, June.
    15. Feng Shan & Liwei Zhang & Xiantao Xiao, 2014. "A Smoothing Function Approach to Joint Chance-Constrained Programs," Journal of Optimization Theory and Applications, Springer, vol. 163(1), pages 181-199, October.
    16. Hua Sun & Ziyou Gao & W. Szeto & Jiancheng Long & Fangxia Zhao, 2014. "A Distributionally Robust Joint Chance Constrained Optimization Model for the Dynamic Network Design Problem under Demand Uncertainty," Networks and Spatial Economics, Springer, vol. 14(3), pages 409-433, December.
    17. Ernst Roos & Dick den Hertog, 2020. "Reducing Conservatism in Robust Optimization," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1109-1127, October.
    18. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.
    19. M. J. Naderi & M. S. Pishvaee, 2017. "Robust bi-objective macroscopic municipal water supply network redesign and rehabilitation," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 31(9), pages 2689-2711, July.
    20. Zhang, Wei & (Ato) Xu, Wangtu, 2017. "Simulation-based robust optimization for the schedule of single-direction bus transit route: The design of experiment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 203-230.

    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:4:d:10.1007_s10898-016-0438-0. 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.