No CrossRef data available.
Article contents
An Algorithm for Counting the Number of Possible Portfolios Given Linear Restrictions on the Weights
Published online by Cambridge University Press: 19 October 2009
Extract
In application of portfolio selection algorithms [3,4] and in tests of the effectiveness of these approaches [1,2], it is sometimes useful to know, a priori, the size of the set of possible portfolios that may be encountered. Given a set of linear restrictions such as that worked by Frankfurter, Phillips, and Seagle [1,2], the set of possible portfolios is finite. This note presents a simple algorithm for determining the size of this set. Only two inputs are required:
1. The size of the universe of securities under study, and
2. A functional relationship which acts as a constraint on the weights.
The following is a heuristic algorithm without a rigorous, generalized proof.
- Type
- Research Article
- Information
- Journal of Financial and Quantitative Analysis , Volume 11 , Issue 3 , September 1976 , pp. 479 - 480
- Copyright
- Copyright © School of Business Administration, University of Washington 1976