IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v33y2021i3p1056-1069.html
   My bibliography  Save this article

An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems

Author

Listed:
  • Xiaodi Bai

    (School of Management, Zhejiang University of Technology, Hangzhou, Zhejiang 310023, P.R. China)

  • Jie Sun

    (School of Business, National University of Singapore, Singapore 119245)

  • Xiaojin Zheng

    (School of Economics and Management, Tongji University, Shanghai 200092, P.R. China)

Abstract

Joint chance-constrained optimization problems under discrete distributions arise frequently in financial management and business operations. These problems can be reformulated as mixed-integer programs. The size of reformulated integer programs is usually very large even though the original problem is of medium size. This paper studies an augmented Lagrangian decomposition method for finding high-quality feasible solutions of complex optimization problems, including nonconvex chance-constrained problems. Different from the current augmented Lagrangian approaches, the proposed method allows randomness to appear in both the left-hand-side matrix and the right-hand-side vector of the chance constraint. In addition, the proposed method only requires solving a convex subproblem and a 0-1 knapsack subproblem at each iteration. Based on the special structure of the chance constraint, the 0-1 knapsack problem can be computed in quasi-linear time, which keeps the computation for discrete optimization subproblems at a relatively low level. The convergence of the method to a first-order stationary point is established under certain mild conditions. Numerical results are presented in comparison with a set of existing methods in the literature for various real-world models. It is observed that the proposed method compares favorably in terms of the quality of the best feasible solution obtained within a certain time for large-size problems, particularly when the objective function of the problem is nonconvex or the left-hand-side matrix of the constraints is random.

Suggested Citation

  • Xiaodi Bai & Jie Sun & Xiaojin Zheng, 2021. "An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1056-1069, July.
  • Handle: RePEc:inm:orijoc:v:33:y:2021:i:3:p:1056-1069
    DOI: 10.1287/ijoc.2020.1001
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2020.1001
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2020.1001?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
    ---><---

    References listed on IDEAS

    as
    1. Bruce L. Miller & Harvey M. Wagner, 1965. "Chance Constrained Programming with Joint Constraints," Operations Research, INFORMS, vol. 13(6), pages 930-945, December.
    2. Zheng, Xiaojin & Sun, Xiaoling & Li, Duan & Cui, Xueting, 2012. "Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs," European Journal of Operational Research, Elsevier, vol. 221(1), pages 38-48.
    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. 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.
    5. Sun, Jie & Zhang, Su, 2010. "A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1210-1220, December.
    6. Darinka Dentcheva & Gabriela Martinez, 2012. "Augmented Lagrangian method for probabilistic optimization," Annals of Operations Research, Springer, vol. 200(1), pages 109-130, November.
    7. QIU, Feng & AHMED, Shabbir & DEY, Santanu S & WOLSEY, Laurence A, 2014. "Covering linear programming with violations," LIDAM Reprints CORE 2618, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Feng Qiu & Shabbir Ahmed & Santanu S. Dey & Laurence A. Wolsey, 2014. "Covering Linear Programming with Violations," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 531-546, August.
    9. Yongjia Song & James R. Luedtke & Simge Küçükyavuz, 2014. "Chance-Constrained Binary Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 735-747, November.
    10. Miguel A. Lejeune & François Margot, 2016. "Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities," Operations Research, INFORMS, vol. 64(4), pages 939-957, August.
    11. A. Charnes & W. W. Cooper, 1959. "Chance-Constrained Programming," Management Science, INFORMS, vol. 6(1), pages 73-79, October.
    12. Miguel A. Lejeune, 2012. "Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems," Operations Research, INFORMS, vol. 60(6), pages 1356-1372, December.
    13. 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.
    14. Lejeune, Miguel & Noyan, Nilay, 2010. "Mathematical programming approaches for generating p-efficient points," European Journal of Operational Research, Elsevier, vol. 207(2), pages 590-600, December.
    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. Lukáš Adam & Martin Branda, 2016. "Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 419-436, August.
    17. Zheng, Xiaojin & Wu, Baiyi & Cui, Xueting, 2017. "Cell-and-bound algorithm for chance constrained programs with discrete distributions," European Journal of Operational Research, Elsevier, vol. 260(2), pages 421-431.
    18. Zhaolin Hu & L. Hong & Liwei Zhang, 2013. "A smooth Monte Carlo approach to joint chance-constrained programs," IISE Transactions, Taylor & Francis Journals, vol. 45(7), pages 716-735.
    19. Reich, Daniel, 2013. "A linear programming approach for linear programs with probabilistic constraints," European Journal of Operational Research, Elsevier, vol. 230(3), pages 487-494.
    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. Liwei Zhang & Yule Zhang & Jia Wu & Xiantao Xiao, 2022. "Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2989-3006, November.

    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 & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    2. Lukáš Adam & Martin Branda, 2016. "Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 419-436, August.
    3. Xiao Liu & Simge Küçükyavuz, 2018. "A polyhedral study of the static probabilistic lot-sizing problem," Annals of Operations Research, Springer, vol. 261(1), pages 233-254, February.
    4. 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).
    5. Lukáš Adam & Martin Branda & Holger Heitsch & René Henrion, 2020. "Solving joint chance constrained problems using regularization and Benders’ decomposition," Annals of Operations Research, Springer, vol. 292(2), pages 683-709, September.
    6. Zheng, Xiaojin & Wu, Baiyi & Cui, Xueting, 2017. "Cell-and-bound algorithm for chance constrained programs with discrete distributions," European Journal of Operational Research, Elsevier, vol. 260(2), pages 421-431.
    7. 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.
    8. Yanikoglu, I. & den Hertog, D., 2011. "Safe Approximations of Chance Constraints Using Historical Data," Other publications TiSEM ab77f6f2-248a-42f1-bde1-0, Tilburg University, School of Economics and Management.
    9. Yanikoglu, I. & den Hertog, D., 2011. "Safe Approximations of Chance Constraints Using Historical Data," Discussion Paper 2011-137, Tilburg University, Center for Economic Research.
    10. Álvaro Porras & Concepción Domínguez & Juan Miguel Morales & Salvador Pineda, 2023. "Tight and Compact Sample Average Approximation for Joint Chance-Constrained Problems with Applications to Optimal Power Flow," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1454-1469, November.
    11. İhsan Yanıkoğlu & Dick den Hertog, 2013. "Safe Approximations of Ambiguous Chance Constraints Using Historical Data," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 666-681, November.
    12. 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.
    13. Lu, Mengshi & Nakao, Hideaki & Shen, Siqian & Zhao, Lin, 2021. "Non-profit resource allocation and service scheduling with cross-subsidization and uncertain resource consumptions," Omega, Elsevier, vol. 99(C).
    14. Gianpiero Canessa & Julian A. Gallego & Lewis Ntaimo & Bernardo K. Pagnoncelli, 2019. "An algorithm for binary linear chance-constrained problems using IIS," Computational Optimization and Applications, Springer, vol. 72(3), pages 589-608, April.
    15. Rashed Khanjani-Shiraz & Salman Khodayifar & Panos M. Pardalos, 2021. "Copula theory approach to stochastic geometric programming," Journal of Global Optimization, Springer, vol. 81(2), pages 435-468, October.
    16. 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.
    17. Roya Karimi & Jianqiang Cheng & Miguel A. Lejeune, 2021. "A Framework for Solving Chance-Constrained Linear Matrix Inequality Programs," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1015-1036, July.
    18. Shanshan Wang & Jinlin Li & Sanjay Mehrotra, 2021. "Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1661-1677, October.
    19. Miguel A. Lejeune, 2012. "Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems," Operations Research, INFORMS, vol. 60(6), pages 1356-1372, December.
    20. 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.

    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:orijoc:v:33:y:2021:i:3:p:1056-1069. 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: 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.