IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v56y2024i8p841-854.html
   My bibliography  Save this article

Optimizing risk budgets in portfolio selection problem: A bi-level model and an efficient gradient-based algorithm

Author

Listed:
  • Maryam Bayat
  • Farnaz Hooshmand
  • Seyed Ali MirHassani

Abstract

Risk budgeting is one of the recent and successful strategies for asset portfolio selection. In this strategy, risk budgets are associated with assets, and the amount of investment is adjusted so that the contribution of each asset to the portfolio risk is proportional to its risk budget. To the best of our knowledge, no specific method has been presented in the literature to systematically determine the value of risk budgets. To fill this research gap, in this article, we consider the risk budgets as decision variables and present a bi-level programming model where the upper level decides the risk budgets and the lower level determines the risk budgeting portfolio. Three approaches are introduced to solve the model. The first is a single-level reformulation of the bi-level model, the second is a novel gradient-based algorithm, and the third is the particle swarm optimization algorithm. Moreover, the k-means clustering method is utilized to determine the assets involved in the portfolio. Computational results over real-world datasets demonstrate the significance of the bi-level model. In addition, the results confirm the proficiency of our gradient-based algorithm from both solution quality and running time.

Suggested Citation

  • Maryam Bayat & Farnaz Hooshmand & Seyed Ali MirHassani, 2024. "Optimizing risk budgets in portfolio selection problem: A bi-level model and an efficient gradient-based algorithm," IISE Transactions, Taylor & Francis Journals, vol. 56(8), pages 841-854, August.
  • Handle: RePEc:taf:uiiexx:v:56:y:2024:i:8:p:841-854
    DOI: 10.1080/24725854.2023.2238204
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2023.2238204
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2023.2238204?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.

    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:taf:uiiexx:v:56:y:2024:i:8:p:841-854. 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.

    We have no bibliographic references for this item. You can help adding them by using 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.