IDEAS home Printed from https://ideas.repec.org/a/wly/jnddns/v2016y2016i1n8417643.html

Stochastic Portfolio Selection Problem with Reliability Criteria

Author

Listed:
  • Xiangsong Meng
  • Lixing Yang

Abstract

Portfolio selection focuses on allocating the capital to a set of securities such that the profit or the risks can be optimized. Due to the uncertainty of the real‐world life, the return parameters always take uncertain information in the realistic environments because of the scarcity of the a priori knowledge or uncertain disturbances. This paper particularly considers a portfolio selection process in the stochastic environment, where the return parameters are characterized by sample‐based correlated random variables. To decrease the decision risks, three evaluation criteria are proposed to generate the reliable portfolio selection plans, including max‐min reliability criterion, percentile reliability criterion, and expected disutility criterion. The equivalent linear (mixed integer) programming models are also deduced for different evaluation strategies. A genetic algorithm with a polishing strategy is designed to search for the approximate optimal solutions of the proposed models. Finally, a series of numerical experiments are implemented to demonstrate the effectiveness and performance of the proposed approaches.

Suggested Citation

  • Xiangsong Meng & Lixing Yang, 2016. "Stochastic Portfolio Selection Problem with Reliability Criteria," Discrete Dynamics in Nature and Society, John Wiley & Sons, vol. 2016(1).
    • Handle: RePEc:wly:jnddns:v:2016:y:2016:i:1:n:8417643
    DOI: 10.1155/2016/8417643
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2016/8417643
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2016/8417643?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. Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
    2. Najafi, Amir Abbas & Mushakhian, Siamak, 2015. "Multi-stage stochastic mean–semivariance–CVaR portfolio optimization under transaction costs," Applied Mathematics and Computation, Elsevier, vol. 256(C), pages 445-458.
    3. Xing, Xin & Hu, Jinjin & Yang, Yaning, 2014. "Robust minimum variance portfolio with L-infinity constraints," Journal of Banking & Finance, Elsevier, vol. 46(C), pages 107-117.
    4. Chung, Ji-Won & Oh, Seog-Moon & Choi, In-Chan, 2009. "A hybrid genetic algorithm for train sequencing in the Korean railway," Omega, Elsevier, vol. 37(3), pages 555-565, June.
    5. Yang, Lixing & Zhang, Yan & Li, Shukai & Gao, Yuan, 2016. "A two-stage stochastic optimization model for the transfer activity choice in metro networks," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 271-297.
    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. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
    2. Zhang, Yu & Tang, Jiafu, 2018. "Itinerary planning with time budget for risk-averse travelers," European Journal of Operational Research, Elsevier, vol. 267(1), pages 288-303.
    3. Zhang, Yu & Tang, Jiafu, 2018. "A robust optimization approach for itinerary planning with deadline," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 113(C), pages 56-74.
    4. Wang, Li & Yang, Lixing & Gao, Ziyou, 2016. "The constrained shortest path problem with stochastic correlated link travel times," European Journal of Operational Research, Elsevier, vol. 255(1), pages 43-57.
    5. Margherita Giuzio, 2017. "Genetic algorithm versus classical methods in sparse index tracking," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 40(1), pages 243-256, November.
    6. Seyoung Park & Eun Ryung Lee & Sungchul Lee & Geonwoo Kim, 2019. "Dantzig Type Optimization Method with Applications to Portfolio Selection," Sustainability, MDPI, vol. 11(11), pages 1-32, June.
    7. Huizhi Ren & Shenshen Sun, 2016. "A Hybrid IP/GA Approach to the Parallel Production Lines Scheduling Problem," Discrete Dynamics in Nature and Society, John Wiley & Sons, vol. 2016(1).
    8. Canca, David & Barrena, Eva, 2018. "The integrated rolling stock circulation and depot location problem in railway rapid transit systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 115-138.
    9. Tsao, Yu-Chung & Thanh, Vo-Van, 2019. "A multi-objective mixed robust possibilistic flexible programming approach for sustainable seaport-dry port network design under an uncertain environment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 124(C), pages 13-39.
    10. Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.
    11. Víctor Adame-García & Fernando Fernández-Rodríguez & Simón Sosvilla-Rivero, 2017. "“Resolution of optimization problems and construction of efficient portfolios: An application to the Euro Stoxx 50 index"," IREA Working Papers 201702, University of Barcelona, Research Institute of Applied Economics, revised Feb 2017.
    12. Li, Wenjie & Yang, Lixing & Wang, Li & Zhou, Xuesong & Liu, Ronghui & Gao, Ziyou, 2017. "Eco-reliable path finding in time-variant and stochastic networks," Energy, Elsevier, vol. 121(C), pages 372-387.
    13. Xin Hai & Gregoire Loeper & Kihun Nam, 2023. "Data-driven Multiperiod Robust Mean-Variance Optimization," Papers 2306.16681, arXiv.org, revised Jul 2023.
    14. Guo, Xin & Wu, Jianjun & Sun, Huijun & Yang, Xin & Jin, Jian Gang & Wang, David Z.W., 2020. "Scheduling synchronization in urban rail transit networks: Trade-offs between transfer passenger and last train operation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 138(C), pages 463-490.
    15. Vrinda Dhingra & S. K. Gupta, 2025. "An Empirical Study of Robust Mean-Variance Portfolios with Short Selling," Computational Economics, Springer;Society for Computational Economics, vol. 66(3), pages 1943-1968, September.
    16. Blanco, Víctor & Puerto, Justo & Ramos, Ana B., 2011. "Expanding the Spanish high-speed railway network," Omega, Elsevier, vol. 39(2), pages 138-150, April.
    17. Giovanni Bonaccolto & Massimiliano Caporin & Sandra Paterlini, 2018. "Asset allocation strategies based on penalized quantile regression," Computational Management Science, Springer, vol. 15(1), pages 1-32, January.
    18. Pejman Peykani & Mojtaba Nouri & Mir Saman Pishvaee & Camelia Oprean-Stan & Emran Mohammadi, 2023. "Credibilistic Multi-Period Mean-Entropy Rolling Portfolio Optimization Problem Based on Multi-Stage Scenario Tree," Mathematics, MDPI, vol. 11(18), pages 1-23, September.
    19. Maciel, Leandro, 2021. "A new approach to portfolio management in the Brazilian equity market: Does assets efficiency level improve performance?," The Quarterly Review of Economics and Finance, Elsevier, vol. 81(C), pages 38-56.
    20. Reus, Lorenzo & Pagnoncelli, Bernardo & Armstrong, Margaret, 2019. "Better management of production incidents in mining using multistage stochastic optimization," Resources Policy, Elsevier, vol. 63(C), pages 1-1.

    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:wly:jnddns:v:2016:y:2016:i:1:n:8417643. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/3059 .

    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.