A Simple Algorithm for the Portfolio Selection Problem
- Full Text PDF
- Author(s): ALAN L. LEWIS
- Published: Apr 30, 2012
- Pages: 71-82
- DOI: 10.1111/j.1540-6261.1988.tb02589.x
The author presents a rapidly convergent algorithm to solve the general portfolio problem of maximizing concave utility functions subject to linear constraints. The algorithm is based on an iterative use of the Markowitz critical line method for solving quadratic programs. A simple example, taken from the theory of state‐contingent claims, is worked out in detail. For technical convergence results, the reader is referred to the appropriate mathematical programming literature.