IDEAS home Printed from https://ideas.repec.org/p/sce/scecfa/357.html
   My bibliography  Save this paper

A Genetic Algorithm for UPM/LPM Portfolios

Author

Listed:
  • David Moreno

    (BUSINESS ADMINISTRATION UNIVERSITY CARLOS III)

  • David Nawrocki

    (Villanova University, College of Commence and Finance, (Philadelphia, USA))

  • Ignacio Olmeda

    (Universidad de Alcala, Computer Science Department (Madrid, Spain))

Abstract

Some researchers and many practitioners have move from the classic mean-variance (Markowitz, 1959) portfolio theory to a new portfolio optimization framework based on downside-risk measures that are more appropriate to the investor’s preferences. Moreover, several studies (Friedman and Savage, 1952; Kahneman and Tversky, 1979) have point out the existence of S-shape utility functions in investors, which mean, investors are risk-averse and risk-seeking. In this paper we propose a new portfolio optimization framework based on minimizing the Lower-Partial-Moment (LPM) and maximizing the upper-partial-moment (UPM) returns that is more in accordance to the investor’s behavior and the S-shape utility function found in real world. Given the complexity of the optimization problem, and the high nonlinearities and discontinuities, we use a metaheuristic (genetic algorithm) to achieve our goal. We find that, in general, the UPM-LPM portfolio optimization beats the classical mean-variance optimization and the mean-downside risk portfolios. Also, we find that the bigger differences happen close to the portfolio of minimum downside-risk and the smallest differences are in the area of the efficient frontier where the potential upside return is maximize.

Suggested Citation

  • David Moreno & David Nawrocki & Ignacio Olmeda, 2006. "A Genetic Algorithm for UPM/LPM Portfolios," Computing in Economics and Finance 2006 357, Society for Computational Economics.
  • Handle: RePEc:sce:scecfa:357
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Keywords

    Downside-risk; Upper-Partial-Moment; Genetic Algorithm; Optimization;
    All these keywords.

    JEL classification:

    • G11 - Financial Economics - - General Financial Markets - - - Portfolio Choice; Investment Decisions
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    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:sce:scecfa:357. 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: Christopher F. Baum (email available below). General contact details of provider: https://edirc.repec.org/data/sceeeea.html .

    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.