用遗传算法求解改进的投资组合模型

被引:13
作者
林丹
李小明
王萍
机构
[1] 天津大学数学系
关键词
投资组合; 最小交易量; 交易费用; 遗传算法;
D O I
暂无
中图分类号
F224 [经济数学方法];
学科分类号
0701 ; 070104 ;
摘要
在传统Markowitz投资组合模型中考虑了最小交易量、交易费用以及最大投资上限等实际因素,得到了一个改进的投资组合模型。该模型是一个非线性整数规划问题,传统算法难以有效求解。为此,设计了一种基于整数编码的遗传算法求解该模型。实际算例表明,所提出的算法是有效的。
引用
收藏
页码:68 / 72
页数:5
相关论文
共 8 条
  • [1] Portfolio optimization problems under concave transaction costs and minimal transaction unit constraints. Konno H,Wijayanayake A. Mathematical Programming . 2001
  • [2] The mean-variance approach to portfolio optimization subject to transaction costs. Yoshimoto A. Journal of Operations Research Society of Japan . 1996
  • [3] A model of portfolio selection with order of expected returns. Xia Y,Liu B,Wang S Y. Computers and Operations Research . 2000
  • [4] Heuristic algorithms for a portfolio selection probl 0em with minimum transaction lots. Masini R,Speranza M G. European Journal of Operational Research . 1999
  • [5] On selecting a portfolio with fixed costs and minimum lots. Kellerer H,Mansini R,Speranza M G. Annals of Operation Research . 2000
  • [6] Heuristics for cardinality constrained portfolio optimization. Chang T J,Meade N,Beasley J E,et al. Computers and Operations Research . 2000
  • [7] Portfolio selection. Markowitz H. The Journal of Finance . 1952
  • [8] Simulated binary crossover for continuous search space. Deb G K,Agrawal R B. Complex Systems . 1995