Abstract.
We will propose a branch and bound algorithm for calculating a globally optimal solution of a portfolio construction/rebalancing problem under concave transaction costs and minimal transaction unit constraints. We will employ the absolute deviation of the rate of return of the portfolio as the measure of risk and solve linear programming subproblems by introducing (piecewise) linear underestimating function for concave transaction cost functions. It will be shown by a series of numerical experiments that the algorithm can solve the problem of practical size in an efficient manner.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received: July 15, 1999 / Accepted: October 1, 2000¶Published online December 15, 2000
Rights and permissions
About this article
Cite this article
Konno, H., Wijayanayake, A. Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints. Math. Program. 89, 233–250 (2001). https://doi.org/10.1007/PL00011397
Issue Date:
DOI: https://doi.org/10.1007/PL00011397