期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A branch-and-bound algorithm for discrete multi-factor portfolio optimization model 被引量:1
1
作者 牛淑芬 王国欣 孙小玲 《Journal of Shanghai University(English Edition)》 CAS 2008年第1期26-30,共5页
In this paper, a new branch-and-bound algorithm based on the Lagrangian dual relaxation and continuous relaxation is proposed for discrete multi-factor portfolio selection model with roundlot restriction in financial ... In this paper, a new branch-and-bound algorithm based on the Lagrangian dual relaxation and continuous relaxation is proposed for discrete multi-factor portfolio selection model with roundlot restriction in financial optimization. This discrete portfolio model is of integer quadratic programming problems. The separable structure of the model is investigated by using Lagrangian relaxation and dual search. Computational results show that the algorithm is capable of solving real-world portfolio problems with data from US stock market and randomly generated test problems with up to 120 securities. 展开更多
关键词 portfolio optimization discrete multi-factor model Lagrangian relaxation and continuous relaxation branch-and-bound method.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部