IDEAS home Printed from https://ideas.repec.org/a/gam/jjrfmx/v18y2025i4p218-d1637359.html
   My bibliography  Save this article

Multi-Period Portfolio Optimization Model with Cone Constraints and Discrete Decisions

Author

Listed:
  • Ümit Sağlam

    (Department of Management and Supply Chain, College of Business and Technology, East Tennessee State University, Johnson City, TN 37614, USA
    These authors contributed equally to this work.)

  • Hande Y. Benson

    (Department of Decision Sciences and MIS, LeBow College of Business, Drexel University, Philadelphia, PA 19104, USA
    These authors contributed equally to this work.)

Abstract

This work develops a practical multi-period optimization approach that incorporates real-world constraints, including discrete decisions and conic risk constraints. Expanding upon earlier single-period models, our framework employs a binary scenario tree derived from monthly returns of randomly selected S&P 500 stocks to represent market evolution across multiple periods. The formulation captures essential portfolio constraints, such as transaction fees, sector diversification, and minimum investment thresholds, resulting in a robust and comprehensive optimization approach. To efficiently solve the resulting mixed-integer second-order cone programming (MISOCP) problem, we employ an outer approximation algorithm with a warmstart strategy, which significantly improves solution runtimes and computational efficiency. Numerical experiments demonstrate the model’s effectiveness, showing an average improvement of 10.71 % in iteration count and 15.24 % in computational time when using the warmstart approach.

Suggested Citation

  • Ümit Sağlam & Hande Y. Benson, 2025. "Multi-Period Portfolio Optimization Model with Cone Constraints and Discrete Decisions," JRFM, MDPI, vol. 18(4), pages 1-16, April.
  • Handle: RePEc:gam:jjrfmx:v:18:y:2025:i:4:p:218-:d:1637359
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1911-8074/18/4/218/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1911-8074/18/4/218/
    Download Restriction: no
    ---><---

    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:gam:jjrfmx:v:18:y:2025:i:4:p:218-:d:1637359. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.