期刊文献+

军队技术人才培养规划的鲁棒优化研究 被引量:2

Study on Military Technical Talents Training Plan with Robust Optimization
原文传递
导出
摘要 本文针对军队发展带来技术人才需求的动态变化,通过将技术人才各方面素质需求的不确定性离散成三种不同情景,采用鲁棒优化方法构建了军队人才培养的鲁棒优化模型,以军队信息化建设人才需求为背景,以某部人才队伍为研究对象进行了实证求解,并比较了基于单一情景的规划结果与鲁棒优化模型的结果。研究结果表明,鲁棒优化模型对于军队人才培养规划制定具有更好的稳定性和可行性。 In order to adapt the dynamic changes of the demand for technical talents, in this paper,the uncertainty of the quality needs for the technical talents are discretized into three different situations, and the robust optimization model of military talents training is established through the method of robust optimiza- tion. The example of talents training programs in the next few years is set to explain the solving methods of robust optimization model based on the background of information construction. The results show that the stability and feasibility of the robust optimization model are much better than other model in the process of talents training planning.
作者 刘小午 王颖
出处 《中国管理科学》 CSSCI 北大核心 2013年第6期185-192,共8页 Chinese Journal of Management Science
关键词 技术人才 动态需求 多目标规划 鲁棒优化 technical talents developmental requirements multi-objective programming robust optimi-zation
  • 相关文献

参考文献23

  • 1李贵富.依托培养是走军民融合式军事人才培养道路的战略举措[J]中国国防经济,2008(06):68-71.
  • 2王修来,毛传新,饶伟.军民人力资本融合模式选择的模型分析[J].军事经济研究,2009,30(4):16-18. 被引量:3
  • 3王秀华,周慧贞,杨柏春.浅议军队装备保障人才军民融合式培养[J].装备指挥技术学院学报,2010,21(4):26-29. 被引量:4
  • 4徐元元,洪庆根.生长军官学员学风评价研究[J].海军航空工程学院学报,2006,21(3):397-400. 被引量:1
  • 5Kouvelis P,Yu Gang. Robust discrete optimization and its applications[J].{H}Boston:Kluwer Academic Publishers,1997.
  • 6Inuiguchi M,Sakawa M. Minimax regret solution to lin ear programming problems with an interval objective function[J].{H}European Journal of Operational Research,1995.526-536.
  • 7Yu Gang. Min-max optimization of several classical discrete optimization problems[J].{H}Journal of Optimization Theory and Applications,1998.221-242.
  • 8Aghassi M,Bertsimas D. Robust game theory[J].Nathematical Programming,2006.231-273.
  • 9Yu Gang,Yang Jian. On the robust shortest path problem[J].{H}Computers & Operations Research,1998.457-468.
  • 10Averbakh I. Minmax regret solutions for minimax optimization problems with uncertainty[J].Operations Research Letters,2000,(2):57-65.doi:10.1016/S0167-6377(00)00025-0.

二级参考文献52

共引文献70

同被引文献42

引证文献2

二级引证文献30

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部