IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v72y2021i6p1415-1431.html
   My bibliography  Save this article

An exact algorithm for small-cardinality constrained portfolio optimisation

Author

Listed:
  • David I. Graham
  • Matthew J. Craven

Abstract

Real-world portfolio optimisation problems are often NP-hard, their efficient frontiers (EFs) in practice being calculated by randomised algorithms. In this work, a deterministic method of decomposition of EFs into a short sequence of sub-EFs is presented. These sub-EFs may be calculated by a quadratic programming algorithm, the collection of such sub-EFs then being subjected to a sifting process to produce the full EF. Full EFs of portfolio optimisation problems with small-cardinality constraints are computed to a high resolution, providing a fast and practical alternative to randomised algorithms. The method may also be used with other practical classes of portfolio problems, complete with differing measures of risk. Finally, it is shown that the identified sub-EFs correspond closely to local optima of the objective function of a case study evolutionary algorithm.

Suggested Citation

  • David I. Graham & Matthew J. Craven, 2021. "An exact algorithm for small-cardinality constrained portfolio optimisation," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(6), pages 1415-1431, June.
    • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:6:p:1415-1431
    DOI: 10.1080/01605682.2020.1718019
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2020.1718019
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2020.1718019?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Marcello Calvanese Strinati & Claudio Conti, 2022. "Multidimensional hyperspin machine," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    2. Salo, Ahti & Doumpos, Michalis & Liesiö, Juuso & Zopounidis, Constantin, 2024. "Fifty years of portfolio optimization," European Journal of Operational Research, Elsevier, vol. 318(1), pages 1-18.

    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:tjorxx:v:72:y:2021:i:6:p:1415-1431. 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/tjor .

    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.