A Simple Algorithm for Optimal Portfolio Selection with Fixed Transaction Costs

Published Online:https://doi.org/10.1287/mnsc.28.3.303

The general optimal portfolio selection problem with fixed transaction costs is a complex mathematical programming problem. However, by placing reasonable restrictions on the variance-covariance matrix of returns, it is possible to simplify the solution of the problem. Specifically if the structure of returns between securities is such that the pairwise correlation coefficients are approximately the same, a fairly simple algorithm which requires little computational effort can be employed. This method can also be extended to the case where changes in the information set necessitate a revision of an existing portfolio.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.