A Linear Programming Algorithm for Mutual Fund Portfolio Selection
The portfolio selection problem faced by a mutual fund manager can be formulated following the Markowitz approach: find those portfolios that are efficient in terms of predicted expected return and standard deviation of return, subject to legal constraints in the form of upper bounds on the proportion of the fund invested in any single security. This paper suggests that such problems be re-formulated as parametric linear-programming problems, utilizing a linear approximation to the true (quadratic) formula for a portfolio's risk. Limited empirical evidence suggests that the approximation is acceptable. Moreover, it allows the use of an extremely simple and efficient special-purpose solution algorithm. With appropriate modifications, this algorithm may prove useful to the managers of mutual funds with a wide variety of objectives.
Volume (Year): 13 (1967)
Issue (Month): 7 (March)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:13:y:1967:i:7:p:499-510. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.