Skip to main content
Log in

Portfolio Selection and Transactions Costs

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

This paper deals with the portfolio selection problem of risky assets with a diagonal covariance matrix, upper bounds on all assets and transactions costs. An algorithm for its solution is formulated which terminates in a number of iterations that is at most three times the number of assets. The efficient portfolios, under appropriate assumptions, are shown to have the following structure. As the risk tolerance parameter increases, an asset's holdings increases to its target, then stays there for a while, then increases to its upper bound, reaches it and stays there. Then the holdings of the asset with the next highest expected return proceeds in a similar way and so on.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M.J. Best and N. Chakravarti, “An O(n 2) active set method for solving a certain parametric quadratic program,” Journal of Optimization Theory and Applications, vol. 72, no. 2, pp. 213–224, 1992.

    Google Scholar 

  2. M.J. Best and R.R. Grauer, “The efficient set mathematics when mean-variance problems are subject to general linear constraints,” Journal of Economics and Business, vol. 42, pp. 105–120, 1990.

    Google Scholar 

  3. M.J. Best and R.R. Grauer, “Sensitivity analysis for mean-variance portfolio problems,” Management Science, vol. 37, pp. 980–989, 1991.

    Google Scholar 

  4. M.J. Best and J. Hlouskova, “The efficient frontier for bounded assets,” Mathematical Methods of Operations Research, vol. 52, no. 2, pp. 195–212, 2000.

    Google Scholar 

  5. M.J. Best and J.K. Kale, “Quadratic programming for large-scale portfolio optimization,” in Financial Services Information Systems, Jessica Keyes (Ed.), CRC Press: Boca Raton, FL, 2000, pp. 513–529.

    Google Scholar 

  6. O.L. Mangasarian, Nonlinear Programming, McGraw-Hill: New York, 1969.

    Google Scholar 

  7. H. Markowitz, “The optimization of a quadratic function subject to linear constraints,” Naval Research Logistics Quarterly, March–June, 1956, pp. 111–133.

  8. H. Markowitz, Portfolio Selection: Efficient Diversification of Investment, John Wiley: New York, Yale University Press: New Haven, 1959.

    Google Scholar 

  9. K.G. Murty, Linear Programming, John Wiley and Sons: New York, 1983.

    Google Scholar 

  10. K. Ritter, “A method for solving nonlinear maximum-problems depending on parameters,” Naval Research Logistics Quarterly, vol. 14, pp. 147–162, 1967.

    Google Scholar 

  11. J.B. Schattman, “Portfolio selection under nonconvex transaction costs and capital gains taxes,” Ph.D. Thesis, Rutgers Center for Operations Research, Rutgers University, USA, 2000.

    Google Scholar 

  12. W.F. Sharpe, Portfolio Theory and Capital Markets, McGraw-Hill: New York, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Best, M.J., Hlouskova, J. Portfolio Selection and Transactions Costs. Computational Optimization and Applications 24, 95–116 (2003). https://doi.org/10.1023/A:1021806200854

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021806200854

Navigation