A Minimax Portfolio Selection Rule with Linear Programming Solution
A new principle for choosing portfolios based on historical returns data is introduced; the optimal portfolio based on this principle is the solution to a simple linear programming problem. This principle uses minimum return rather than variance as a measure of risk. In particular, the portfolio is chosen that minimizes the maximum loss over all past observation periods, for a given level of return. This objective function avoids the logical problems of a quadratic (nonmonotone) utility function implied by mean-variance portfolio selection rules. The resulting minimax portfolios are diversified; for normal returns data, the portfolios are nearly equivalent to those chosen by a mean-variance rule. Framing the portfolio selection process as a linear optimization problem also makes it feasible to constrain certain decision variables to be integer, or 0-1, valued; this feature facilitates the use of more complex decision-making models, including models with fixed transaction charges and models with Boolean-type constraints on allocations.
Volume (Year): 44 (1998)
Issue (Month): 5 (May)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:44:y:1998:i:5:p:673-683. 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.