IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0287093.html

A data-driven robust EVaR-PC with application to portfolio management

Author

Listed:
  • Qingyun He
  • Chuanyang Hong

Abstract

We investigate the robust chance constrained optimization problem (RCCOP), which is a combination of the distributionally robust optimization (DRO) and the chance constraint (CC). The RCCOP plays an important role in modeling uncertain parameters within a decision-making framework. The chance constraint, which is equivalent to a constraint of Value-at-risk (VaR), is approximated by risk measures such as Entropic Value-at-risk (EVaR) or Conditional Value-at-risk (CVaR) due to its difficulty to be evaluated. An excellent approximation requires both tractability and non-conservativeness. In addition, the DRO assumes that we know partial information about the distribution of uncertain parameters instead of their known true underlying probability distribution. In this article, we develop a novel approximation EVaR- PC based on EVaR for CC. Then, we evaluate the proposed approximation EVaR- PC using a discrepancy-based ambiguity set with the wasserstein distance. From a theoretical perspective, the EVaR- PC is less conservative than EVaR and the wasserstein distance possesses many good theoretical properties; from a practical perspective, the discrepancy-based ambiguity set can make full use of the data to estimate the nominal distribution and reduce the sensitivity of decisions to priori knowledges. To show the advantages of our method, we show its application in portfolio management in detail and give the relevant experimental results.

Suggested Citation

  • Qingyun He & Chuanyang Hong, 2023. "A data-driven robust EVaR-PC with application to portfolio management," PLOS ONE, Public Library of Science, vol. 18(6), pages 1-16, June.
    • Handle: RePEc:plo:pone00:0287093
    DOI: 10.1371/journal.pone.0287093
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0287093
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0287093&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0287093?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. Svetlozar T. Rachev & Werner Römisch, 2002. "Quantitative Stability in Stochastic Programming: The Method of Probability Metrics," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 792-818, November.
    2. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    3. Enrique Ballestero, 2005. "Mean-Semivariance Efficient Frontier: A Downside Risk Model for Portfolio Selection," Applied Mathematical Finance, Taylor & Francis Journals, vol. 12(1), pages 1-15.
    4. Kibaek Kim & Sanjay Mehrotra, 2015. "A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management," Operations Research, INFORMS, vol. 63(6), pages 1431-1451, December.
    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. Steffen Rebennack, 2022. "Data-driven stochastic optimization for distributional ambiguity with integrated confidence region," Journal of Global Optimization, Springer, vol. 84(2), pages 255-293, October.
    2. Wang, Shanshan & Mehrotra, Sanjay & Peng, Chun, 2025. "Robust concave utility maximization over chance constraints," European Journal of Operational Research, Elsevier, vol. 321(3), pages 800-813.
    3. Tohidi, Mohammad & Kazemi Zanjani, Masoumeh & Contreras, Ivan, 2021. "A physician planning framework for polyclinics under uncertainty," Omega, Elsevier, vol. 101(C).
    4. Sandeep Rath & Kumar Rajaram & Mark E. Hudson & Aman Mahajan, 2026. "Multilocation, Dynamic Staff Planning for a Healthcare System: Methodology and Application," Operations Research, INFORMS, vol. 74(1), pages 199-223, January.
    5. Restrepo, María I. & Rousseau, Louis-Martin & Vallée, Jonathan, 2020. "Home healthcare integrated staffing and scheduling," Omega, Elsevier, vol. 95(C).
    6. Jianwen Ren & Yingqiang Xu & Shiyuan Wang, 2018. "A Distributed Robust Dispatch Approach for Interconnected Systems with a High Proportion of Wind Power Penetration," Energies, MDPI, vol. 11(4), pages 1-18, April.
    7. Li, Xingchen & Xu, Guangcheng & Wu, Jie & Xu, Chengzhen & Zhu, Qingyuan, 2024. "Evaluation of bank efficiency by considering the uncertainty of nonperforming loans," Omega, Elsevier, vol. 126(C).
    8. 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.
    9. 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.
    10. 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.
    11. Hu, Linyuan & Zhang, Yuli & Wen, Muyang & Leus, Roel & Zhang, Ningwei, 2025. "Robust parallel machine selection and scheduling with uncertain release times," European Journal of Operational Research, Elsevier, vol. 327(3), pages 838-856.
    12. Allen M. Wang & Alessandro Pau & Cristina Rea & Oswin So & Charles Dawson & Olivier Sauter & Mark D. Boyer & Anna Vu & Cristian Galperti & Chuchu Fan & Antoine Merle & Yoeri Poels & Cristina Venturini, 2025. "Learning plasma dynamics and robust rampdown trajectories with predict-first experiments at TCV," Nature Communications, Nature, vol. 16(1), pages 1-16, December.
    13. Sarhadi, Hassan & Naoum-Sawaya, Joe & Verma, Manish, 2020. "A robust optimization approach to locating and stockpiling marine oil-spill response facilities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    14. Li, Shukai & Liu, Ronghui & Yang, Lixing & Gao, Ziyou, 2019. "Robust dynamic bus controls considering delay disturbances and passenger demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 88-109.
    15. Jeong, Jaehee & Premsankar, Gopika & Ghaddar, Bissan & Tarkoma, Sasu, 2024. "A robust optimization approach for placement of applications in edge computing considering latency uncertainty," Omega, Elsevier, vol. 126(C).
    16. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    17. Rupendra Yadav & Aparna Mehra, 2025. "Robust MCVaR Portfolio Optimization with Ellipsoidal Support and Reproducing Kernel Hilbert Space-based Uncertainty," Papers 2509.00447, arXiv.org.
    18. Akhtar Hussain & Van-Hai Bui & Hak-Man Kim, 2016. "Robust Optimization-Based Scheduling of Multi-Microgrids Considering Uncertainties," Energies, MDPI, vol. 9(4), pages 1-21, April.
    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. Kandpal, Bakul & Pareek, Parikshit & Verma, Ashu, 2022. "A robust day-ahead scheduling strategy for EV charging stations in unbalanced distribution grid," Energy, Elsevier, vol. 249(C).

    More about this item

    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:plo:pone00:0287093. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.