IDEAS home Printed from https://ideas.repec.org/a/cup/jfinqa/v10y1975i05p859-870_01.html
   My bibliography  Save this article

A Simple Algorithm for Stone's Version of the Portfolio Selection Problem

Author

Listed:
  • Jucker, James V.
  • de Faro, Clovis

Abstract

More than twenty years ago the portfolio selection problem was stated as a parametric quadratic programming problem [3]. Since that time there has been an ongoing search for methods that would allow reductions in both the data and the computational effort required to implement the Markowitz formulation. Markowitz himself developed a special algorithm for the problem [4] Sharpe followed with his famous diagonal model [6], a linear programming approximation for the special case of mutual funds [7], and a linear programming approximation for the general problem [0]. And during this period there were substantial advances in quadratic programming computer codes. A very fast code is now widely available [1], but the size of the code itself (a listing of the annotated program runs to more than 3,000 lines) makes its everyday use for portfolio selection somewhat unattractive.

Suggested Citation

  • Jucker, James V. & de Faro, Clovis, 1975. "A Simple Algorithm for Stone's Version of the Portfolio Selection Problem," Journal of Financial and Quantitative Analysis, Cambridge University Press, vol. 10(5), pages 859-870, December.
    • Handle: RePEc:cup:jfinqa:v:10:y:1975:i:05:p:859-870_01
    as

    Download full text from publisher

    File URL: https://www.cambridge.org/core/product/identifier/S0022109000018974/type/journal_article
    File Function: link to article abstract page
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    2. Zhang, Bin & Hua, Zhongsheng, 2008. "A unified method for a class of convex separable nonlinear knapsack problems," European Journal of Operational Research, Elsevier, vol. 191(1), pages 1-6, November.

    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:cup:jfinqa:v:10:y:1975:i:05:p:859-870_01. 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: Kirk Stebbing (email available below). General contact details of provider: https://www.cambridge.org/jfq .

    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.