首页 | 本学科首页   官方微博 | 高级检索  
     检索      

手数约束和凹交易费下的离散投资组合模型及算法
引用本文:张世涛.手数约束和凹交易费下的离散投资组合模型及算法[J].运筹与管理,2013,22(2):165-171.
作者姓名:张世涛
作者单位:安徽工业大学 数理学院,安徽 马鞍山 243032
基金项目:国家自然科学基金资助项目(70671064);安徽工业大学青年科研基金资助项目(QZ201018)
摘    要:本文建立带手数约束和凹交易费的离散投资组合模型,给出求解该模型的一种精确算法。该算法是一个基于拉格朗日松弛和次梯度对偶搜索的分枝定界算法。为测试算法的有效性,用随机产生的数据对模型进行数值实验。作为其应用,用沪深300指数的真实数据实证检验该模型,并与不含交易费用的离散投资组合模型进行数值比较分析。数值分析表明算法能在合理的时间内给出模型的投资组合策略, 对解决中小规模的离散投资组合问题是有效的。

关 键 词:运筹学  投资组合策略  分枝定界算法  拉格朗日对偶  
收稿时间:2011-09-30

Discrete Portfolio Selection Model and Algorithm under Roundlot Constraint and Concave Transaction Costs
ZHANG Shi-tao.Discrete Portfolio Selection Model and Algorithm under Roundlot Constraint and Concave Transaction Costs[J].Operations Research and Management Science,2013,22(2):165-171.
Authors:ZHANG Shi-tao
Institution:School of Mathematics and Physics, Anhui University of Technology, Ma'anshan 243032, China
Abstract:Given a discrete portfolio selection model with roundlot constraint and concave transaction costs, we propose an exact algorithm for solving the model. The algorithm is of branch-and-bound method based on Lagrangian relaxation and subgradient dual search. To test the effectiveness of the algorithm, we carry out numerical experiments with randomly-generated data. For its application, this paper tests empirically the model with data from CSI300 Index and compares the computational results with those from the discrete portfolio selection model under non-transaction costs. The numerical analysis indicates that the proposed method can give portfolio strategy of the model within a reasonable time and is efficient for solving small-to-medium scale discrete portfolio selection problems.
Keywords:operational research  portfolio strategy  branch-and-bound algorithm  Lagrangian dual  
点击此处可从《运筹与管理》浏览原始摘要信息
点击此处可从《运筹与管理》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号