IDEAS home Printed from https://ideas.repec.org/a/wsi/ijitdm/v20y2021i01ns0219622020500510.html
   My bibliography  Save this article

A New Interactive Algorithm for Continuous Multiple Criteria Problems: A Portfolio Optimization Example

Author

Listed:
  • Gülşah Karakaya

    (Department of Business Administration, Middle East Technical University, Ankara 06800, Turkey)

  • Ceren Tuncer Şakar

    (Department of Industrial Engineering, Hacettepe University, Ankara 06800, Turkey)

Abstract

In continuous multiple criteria problems, finding a distinct preferred solution for a decision maker (DM) is not straightforward. There are few recent studies proposed for this task, and the algorithms developed are cognitively difficult and complex for the DM in general. We propose a novel interactive algorithm to guide the DM in converging highly-preferred solutions in continuous multiple criteria problems. We test our algorithm on portfolio optimization problems formed with the stocks included in the S&P 100 index using expected return, liquidity, conditional value at risk, and mean absolute deviation as criteria. We simulate DM responses with linear and nonlinear preference functions and use various weights for the criteria. The experiments show that our algorithm is able to find highly-preferred solutions in considerably low number of iterations. We also test our algorithm against benchmark algorithms and demonstrate that our algorithm produces superior or comparable results.

Suggested Citation

  • Gülşah Karakaya & Ceren Tuncer Şakar, 2021. "A New Interactive Algorithm for Continuous Multiple Criteria Problems: A Portfolio Optimization Example," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 20(01), pages 371-398, January.
    • Handle: RePEc:wsi:ijitdm:v:20:y:2021:i:01:n:s0219622020500510
    DOI: 10.1142/S0219622020500510
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219622020500510
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219622020500510?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.

    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:wsi:ijitdm:v:20:y:2021:i:01:n:s0219622020500510. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijitdm/ijitdm.shtml .

    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.