Abstract
ABSTRACTThe 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have