Portfolio optimization under DC transaction costs and minimal transaction unit constraints

被引:27
|
作者
Konno, H [1 ]
Wijayanayake, A
机构
[1] Tokyo Inst Technol, Dept Ind Engn & Management, Tokyo, Japan
[2] Tokyo Inst Technol, Ctr Res Adv Financial Technol, Tokyo, Japan
关键词
portfolio optimization; D.c; programming; nonconvex transaction cost; minimal transaction unit constraint; mean-absolute deviation model;
D O I
10.1023/A:1013850928936
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper addresses itself to a portfolio optimization problem under nonconvex transaction costs and minimal transaction unit constraints. Associated with portfolio construction is a fee for purchasing assets. Unit transaction fee is larger when the amount of transaction is smaller. Hence the transaction cost is usually a concave function up to certain point. When the amount of transaction increases, the unit price of assets increases due to illiquidity/market impact effects. Hence the transaction cost becomes convex beyond certain bound. Therefore, the net expected return becomes a general d.c. function (difference of two convex functions). We will propose a branch-and-bound algorithm for the resulting d.c. maximization problem subject to a constraint on the level of risk measured in terms of the absolute deviation of the rate of return of a portfolio. Also, we will show that the minimal transaction unit constraints can be incorporated without excessively increasing the amount of computation.
引用
收藏
页码:137 / 154
页数:18
相关论文
共 50 条
  • [1] Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
    Konno, H
    Wijayanayake, A
    MATHEMATICAL PROGRAMMING, 2001, 89 (02) : 233 - 250
  • [2] Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
    Hiroshi Konno
    Annista Wijayanayake
    Mathematical Programming, 2001, 89 : 233 - 250
  • [3] Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints
    Hiroshi Konno
    Annista Wijayanayake
    Journal of Global Optimization, 2002, 22 : 137 - 154
  • [4] Mean-variance portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
    Yuelin, Gao
    Yuhong, Li
    International Conference on Management Innovation, Vols 1 and 2, 2007, : 509 - 513
  • [5] Mean-CVaR portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
    Gao, Yuelin
    Sun, Ying
    Li, Yuhong
    ICIC 2009: SECOND INTERNATIONAL CONFERENCE ON INFORMATION AND COMPUTING SCIENCE, VOL 1, PROCEEDINGS, 2009, : 79 - 82
  • [6] Portfolio rebalancing with transaction costs and a minimal purchase unit
    Fang, Y
    Lai, KK
    Wang, SY
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2005, 12 (04): : 499 - 515
  • [7] THE ATTAINABILITY OF THE PORTFOLIO OPTIMIZATION UNDER TRANSACTION COSTS
    XU Shimeng(Institute of Applied Mathematics
    Systems Science and Mathematical Sciences, 2000, (03) : 236 - 241
  • [8] DC programming approach for portfolio optimization under step increasing transaction costs
    Le Thi, Hoai An
    Moeini, Mahdi
    Dinh, Tao Pham
    OPTIMIZATION, 2009, 58 (03) : 267 - 289
  • [9] DC programming approaches for discrete portfolio optimization under concave transaction costs
    Tao Pham Dinh
    Hoai An Le Thi
    Viet Nga Pham
    Niu, Yi-Shuai
    OPTIMIZATION LETTERS, 2016, 10 (02) : 261 - 282
  • [10] DC programming approaches for discrete portfolio optimization under concave transaction costs
    Tao Pham Dinh
    Hoai An Le Thi
    Viet Nga Pham
    Yi-Shuai Niu
    Optimization Letters, 2016, 10 : 261 - 282