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

企业家人力资源培训问题的整数规划模型
引用本文:周晓云,钱士茹,陈静,倪明放.企业家人力资源培训问题的整数规划模型[J].运筹与管理,2007,16(2):149-153.
作者姓名:周晓云  钱士茹  陈静  倪明放
作者单位:1. 中国人民解放军理工大学,通信工程学院,江苏,南京,210007
2. 安徽大学,工商管理学院,安徽,合肥,230039
3. 金陵科技学院,江苏,南京,210004
摘    要:本文强调了企业家人力资源在企业核心能力和可持续成长能力生成中的重要作用和地位。基于时间和费用指标,研究了企业家人力资源培训问题,利用0-1线性整数规划建立了一个带有培训时间约束的最小培训费用模型,给出了求解模型的基于Lagrange松弛的分解算法,计算实例表明给出的算法是有效的。

关 键 词:运筹学  企业家人力资源  整数规划  Lagrange松弛  分解算法
文章编号:24365226
修稿时间:10 17 2006 12:00AM

Integer Programming Model of Enterpriser Manpower Training Problem
ZHOU Xiao-yun,QIAN Shi-ru,CHENG Jing,NI Ming-fang.Integer Programming Model of Enterpriser Manpower Training Problem[J].Operations Research and Management Science,2007,16(2):149-153.
Authors:ZHOU Xiao-yun  QIAN Shi-ru  CHENG Jing  NI Ming-fang
Institution:1. Institute of Communications Engineering, PLA University of Science and Technology, Nanjing 210007, China; 2. School of Business Administration, Anhui University, Hefei 230039, China; 3. JinLing Institute of Technology, Nanjing 210004, China
Abstract:This paper emphasizes the important role of enterpriser manpower played in the building of enterprise core competence and sustainable growth competence. The enterpriser manpower training problem is studied. A 0-1 linear integer programming model of minimal charge with time constraint is presented. The decomposition algorithm based on Lagrange relaxation for solving the model is developed. A computation example shows that the decomposition algorithm is efficient.
Keywords:operational research  enterpriser manpower  integer programming  Lagrange relaxation  decomposition algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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