军队技术人才培养规划的鲁棒优化研究

摘要/Abstract

摘要： 本文针对军队发展带来技术人才需求的动态变化，通过将技术人才各方面素质需求的不确定性离散成三种不同情景，采用鲁棒优化方法构建了军队人才培养的鲁棒优化模型，以军队信息化建设人才需求为背景，以某部人才队伍为研究对象进行了实证求解，并比较了基于单一情景的规划结果与鲁棒优化模型的结果。研究结果表明，鲁棒优化模型对于军队人才培养规划制定具有更好的稳定性和可行性。

关键词: 技术人才, 动态需求, 多目标规划, 鲁棒优化

Abstract: 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 optimization. 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.

Key words: technical talents, developmental requirements, multi-objective programming, robust optimization

中图分类号:

C931.2

刘小午, 王颖. 军队技术人才培养规划的鲁棒优化研究[J]. 中国管理科学, 2013, 21(6): 185-192.

LIU Xiao-wu, WANG Ying. Study on Military Technical Talents Training Plan with Robust Optimization[J]. Chinese Journal of Management Science, 2013, 21(6): 185-192.

参考文献

[1] 李贵富. 依托培养是走军民融合式军事人才培养道路的战略举措[J]. 中国国防经济, 2008, (6): 68-71.
[2] 王修来, 毛传新, 饶伟. 军民人力资本融合模式选择的模型分析[J]. 军事经济研究, 2009, (4): 16-18.
[3] 王秀华, 周慧贞, 杨柏春. 浅议军队装备保障人才军民融合式培养[J]. 装备指挥技术学院学报, 2010, 21(4): 26-29.
[4] 徐元元, 洪庆根. 生长军官学员学风评价研究[J]. 海军航空工程学院学报, 2006, 21(3): 397-400.
[5] Kouvelis P, Yu Gang.Robust discrete optimization and its applications[J]. Boston:Kluwer Academic Publishers, 1997.
[6] Inuiguchi M, Sakawa M. Minimax regret solution to linear programming problems with an interval objective function[J]. European Journal of Operational Research, 1995, 86: 526-536.
[7] Yu Gang. Min-max optimization of several classical discrete optimization problems[J]. Journal of Optimization Theory and Applications, 1998, 98: 221-242.
[8] Aghassi M, Bertsimas D. Robust game theory[J]. Nathematical Programming, 2006, 107: 231-273.
[9] Yu Gang, Yang Jian. On the robust shortest path problem[J]. Computers Operations Research, 1998, 25: 457-468.
[10] Averbakh I. Minmax regret solutions for minimax optimization problems with uncertainty[J]. Operations Research Letters, 2000, 27: 57-65.
[11] Kasperski A, Zielinski P. An approximation algorithm for interval data minmax regret combinatorial optimization problems[J]. Information Processing Letters, 2006, 97: 177-180.
[12] Averbakh I, Berman O. Minmax regret median location on a network under uncertainty[J]. INFORMS Journal on Computing, 2000, 12: 104-110.
[13] Averbakh I. The minmax relative regret median problem on networks[J]. INFORMS Journal on Computing, 2005, 17: 451-461.
[14] Kasperski A. Minimizing maximal regret in the single machine sequencing maximum lateness criterion[J]. Operations Research Letters, 2005, 33: 431-436.
[15] 叶泽方. 非确定型决策方法决策目标及决策结果可靠性研究[J]. 管理工程学报, 2000, 14: 59-61.
[16] 马龙华, 叶正波, 郑泳凌, 等. 基于LQR指标的鲁棒PID整定方法及鲁棒稳定性裕度评估[J]. 浙江大学学报(工学版), 2002, 36(5): 486-489.
[17] 姜涛, 朱金福, 朱星辉. 不确定情形下进行决策的鲁棒优化方法研究及应用[J]. 统计与决策, 2007, 3: 32-33.
[18] 高莹, 黄小原. 具有VaR约束的跟踪误差投资组合鲁棒优化模型[J]. 中国管理科学, 2007, 15 (1): 1-5.
[19] 晏妮娜, 黄小原, 马龙龙. 需求不确定环境下多个零售商竞争的鲁棒随机优化模型[J]. 中国管理科学, 2008, 16 (4): 50-54.
[20] 张玲, 王晶, 黄钧. 不确定条件下应急资源配置的鲁棒优化方法[J]. 系统科学与数学, 2010, 30(10): 1283-1292.
[21] Dessler G. 人力资源管理[M]. 曾湘泉, 译.北京: 中国人民大学出版社, 2007.
[22] 李洪兴, 汪培庄. 模糊数学[M]. 北京: 国防工业出版社, 1994.
[23] 孙杰远. 教育统计学[M]. 北京: 高等教育出版社, 2010.