Mean–variance portfolio optimal problem under concave transaction cost

作者:

Highlights:

摘要

In this paper, the classical mean–variance portfolio model is modified for calculating a globally optimal portfolio under concave transaction costs. A non-decreasing concave function is employed to approximate origin transaction cost function. The resulting model is a D-C (difference of two convex functions) programming and a branch and bound algorithm is designed to solve the problem. A series of numerical experiments on the model is presented. The history data of nine stocks in Shan Xi province is used in experiments, and efficient frontiers generated from the resulting model with different limitations on investments are presented to show the effect of the model and the efficiency of the algorithm solving the model.

论文关键词:Mean–variance,Concave transaction cost,Globally optimal portfolio,Branch and bound algorithm,Efficient frontier

论文评审过程:Available online 20 June 2005.

论文官网地址:https://doi.org/10.1016/j.amc.2005.05.005