检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵磊 朱道立[2,3] ZHAO Lei;ZHU Daoli(School of Naval Architecture,Ocean&Civil Engineering,Shanghai Jiao Tong University,Shanghai 200030,China;Antai College of Economics and Management,Shanghai Jiao Tong University,Shanghai 200030,China;Sino-US Global Logistics Institute,Shanghai Jiao Tong University,Shanghai 200030,China)
机构地区:[1]上海交通大学船舶海洋与建筑工程学院,上海200030 [2]上海交通大学安泰经济与管理学院,上海200030 [3]上海交通大学中美物流研究院,上海200030
出 处:《系统管理学报》2021年第2期344-352,共9页Journal of Systems & Management
基 金:国家自然科学基金资助项目(71471112,71871140)。
摘 要:投资者在进行投资组合选择时,通常希望得到的投资组合方案中,被选择资产数量可控,风险水平足够小。模型中通常以基数约束来控制投资组合方案中选择的资产数量。基于一类基数约束投资组合选择模型,该模型以最小化风险函数为目标,在不允许卖空前题下,考虑基数约束和预算约束。该模型应用极其广泛,但目前尚无商用软件可以直接精确求解。提出一种全局最优化算法,在分支定界法框架基础上,以一阶算法求解下界松弛问题。通过Fama-French产业投资组合基准测试数据集设计仿真实验,实验结果表明,本文提出的方法能有效解决带基数约束的产业投资组合问题,能够给出任意基数要求的全局最优投资组合方案。Simplicity of portfolio selection is one of the main challenges faced by investors.In this paper,a family of portfolio model:minimizing risk function while considering cardinal constraint and budget constraint was considered.Besides,a branch and bound algorithm based on the branch and bound framework was proposed.Moreover,the relaxation problem was solved by using the first order method.Furthermore,computational experiments were conducted based on the Fama-French benchmark data.The computational results show that the algorithm proposed in this paper can effectively solve the problem of industrial investment portfolio with cardinality constraints,and can give a global optimal portfolio plan with arbitrary cardinality requirements.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249