Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-15T10:49:05.287Z Has data issue: false hasContentIssue false

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
Copyright
Copyright © School of Business Administration, University of Washington 1976

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Frankfurter, George M.; Phillips, Herbert E.; and Seagle, John P.. “Portfolio Selection: The Effects of Uncertain Means, Variances, and Covariances.” Journal of Financial and Quantitative Analysis, vol. 6 (December 1971), pp. 12511262.Google Scholar
[2]Frankfurter, George M.Performance of the Sharpe Portfolio Selection Model: A Comparison.” Journal of Financial and Quantitative Analysis (June 1976).Google Scholar
[3]Markowitz, Harry M.Portfolio Selection.” Journal of Finance, vol. 1 (March 1952), pp. 7791.Google Scholar
[4]Sharpe, William F.A Simplified Model for Portfolio Analysis.” Management Science, vol. 9 (January 1963), pp. 277293.CrossRefGoogle Scholar