IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v99y2024i1d10.1007_s00186-024-00859-y.html
   My bibliography  Save this article

A D.C. approximation approach for optimization with probabilistic constraints based on Chen–Harker–Kanzow–Smale smooth plus function

Author

Listed:
  • Yonghong Ren

    (Liaoning Normal University)

  • Yuchao Sun

    (Liaoning Normal University)

  • Dachen Li

    (Liaoning Normal University)

  • Fangfang Guo

    (Dalian University of Technology)

Abstract

Many important practical problems can be formulated as probabilistic constrained optimization problem (PCOP), which is challenging to solve since it is usually non-convex and non-smooth. Effective methods for (PCOP) mostly focus on approximation techniques. This paper aims at studying the D.C. (difference of two convex functions) approximation techniques. A D.C. approximation is explored to solve the probabilistic constrained optimization problem based on Chen–Harker–Kanzow–Smale (CHKS) smooth plus function. A smooth approximation to probabilistic constraint function is proposed and the corresponding D.C. approximation problem is established. It is proved that the approximation problem is equivalent to the original one under certain conditions. Sequential convex approximation (SCA) algorithm is implemented to solve the D.C. approximation problem. Sample average approximation method is applied to solve the convex subproblem. Numerical results suggest that D.C. approximation technique is effective for optimization with probabilistic constraints.

Suggested Citation

  • Yonghong Ren & Yuchao Sun & Dachen Li & Fangfang Guo, 2024. "A D.C. approximation approach for optimization with probabilistic constraints based on Chen–Harker–Kanzow–Smale smooth plus function," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 99(1), pages 179-203, April.
    • Handle: RePEc:spr:mathme:v:99:y:2024:i:1:d:10.1007_s00186-024-00859-y
    DOI: 10.1007/s00186-024-00859-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00186-024-00859-y
    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/s00186-024-00859-y?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. 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.
    2. Bruce L. Miller & Harvey M. Wagner, 1965. "Chance Constrained Programming with Joint Constraints," Operations Research, INFORMS, vol. 13(6), pages 930-945, December.
    3. 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.
    4. 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.
    5. 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.
    6. Nan Jiang & Weijun Xie, 2022. "ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs," Operations Research, INFORMS, vol. 70(6), pages 3581-3600, November.
    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. 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.
    2. 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.
    3. 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.
    4. L. Jeff Hong & Jun Luo & Barry L. Nelson, 2015. "Chance Constrained Selection of the Best," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 317-334, May.
    5. 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.
    6. 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.
    7. 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.
    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. Nemirovski, Arkadi, 2012. "On safe tractable approximations of chance constraints," European Journal of Operational Research, Elsevier, vol. 219(3), pages 707-718.
    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. Maji, Chandi Charan, 1975. "Intertemporal allocation of irrigation water in the Mayurakshi Project (India): an application of deterministic and chance-constrained linear programming," ISU General Staff Papers 197501010800006381, Iowa State University, Department of Economics.
    12. Wim Ackooij, 2017. "A comparison of four approaches from stochastic programming for large-scale unit-commitment," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 119-147, March.
    13. Mahboubeh Farid & Hampus Hallman & Mikael Palmblad & Johannes Vänngård, 2021. "Multi-Objective Pharmaceutical Portfolio Optimization under Uncertainty of Cost and Return," Mathematics, MDPI, vol. 9(18), pages 1-11, September.
    14. Rashed Khanjani Shiraz & Madjid Tavana & Hirofumi Fukuyama, 2021. "A joint chance-constrained data envelopment analysis model with random output data," Operational Research, Springer, vol. 21(2), pages 1255-1277, June.
    15. Holger Berthold & Holger Heitsch & René Henrion & Jan Schwientek, 2022. "On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(1), pages 1-37, August.
    16. Bo Rao & Liu Yang & Suhan Zhong & Guangming Zhou, 2024. "Robust approximation of chance constrained optimization with polynomial perturbation," Computational Optimization and Applications, Springer, vol. 89(3), pages 977-1003, December.
    17. Kampas, Athanasios & White, Ben, 2003. "Probabilistic programming for nitrate pollution control: Comparing different probabilistic constraint approximations," European Journal of Operational Research, Elsevier, vol. 147(1), pages 217-228, May.
    18. Bowen Li & Ruiwei Jiang & Johanna L. Mathieu, 2022. "Integrating unimodality into distributionally robust optimal power flow," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(3), pages 594-617, October.
    19. 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.
    20. 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.

    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:mathme:v:99:y:2024:i:1:d:10.1007_s00186-024-00859-y. 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.