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. 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.
    3. 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.
    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.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Xin Hai & Gregoire Loeper & Kihun Nam, 2023. "Data-driven Multiperiod Robust Mean-Variance Optimization," Papers 2306.16681, arXiv.org, revised Jul 2023.
    8. 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.
    9. 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.
    10. 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.
    11. He Huang & Song Gao, 2018. "Trajectory-Adaptive Routing in Dynamic Networks with Dependent Random Link Travel Times," Transportation Science, INFORMS, vol. 52(1), pages 102-117, January.
    12. Lu, Chung-Cheng & Liu, Jiangtao & Qu, Yunchao & Peeta, Srinivas & Rouphail, Nagui M. & Zhou, Xuesong, 2016. "Eco-system optimal time-dependent flow assignment in a congested network," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 217-239.
    13. Qifa Xu & Junqing Zuo & Cuixia Jiang & Yaoyao He, 2021. "A large constrained time‐varying portfolio selection model with DCC‐MIDAS: Evidence from Chinese stock market," International Journal of Finance & Economics, John Wiley & Sons, Ltd., vol. 26(3), pages 3417-3435, July.
    14. Shi Qiang Liu & Erhan Kozan, 2011. "Scheduling Trains with Priorities: A No-Wait Blocking Parallel-Machine Job-Shop Scheduling Model," Transportation Science, INFORMS, vol. 45(2), pages 175-198, May.
    15. Wen, Liang & Çatay, Bülent & Eglese, Richard, 2014. "Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge," European Journal of Operational Research, Elsevier, vol. 236(3), pages 915-923.
    16. Yin, Jiateng & Yang, Lixing & Tang, Tao & Gao, Ziyou & Ran, Bin, 2017. "Dynamic passenger demand oriented metro train scheduling with energy-efficiency and waiting time minimization: Mixed-integer linear programming approaches," Transportation Research Part B: Methodological, Elsevier, vol. 97(C), pages 182-213.
    17. Manseur, Farida & Farhi, Nadir & Nguyen Van Phu, Cyril & Haj-Salem, Habib & Lebacque, Jean-Patrick, 2020. "Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks," European Journal of Operational Research, Elsevier, vol. 285(1), pages 159-171.
    18. Wenliang Zhou & Wenzhuang Fan & Xiaorong You & Lianbo Deng, 2019. "Demand-Oriented Train Timetabling Integrated with Passenger Train-Booking Decisions," Sustainability, MDPI, vol. 11(18), pages 1-34, September.
    19. E. Ursavas & Stuart X. Zhu, 2018. "Integrated Passenger and Freight Train Planning on Shared-Use Corridors," Service Science, INFORMS, vol. 52(6), pages 1376-1390, December.
    20. Zheng Wang & Lin Lin, 2013. "A Simulation‐Based Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Travel Times," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(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.