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

变容量限制多阶段存储问题及其求解算法
引用本文:谢凡荣. 变容量限制多阶段存储问题及其求解算法[J]. 南昌航空工业学院学报, 2004, 18(2): 34-37
作者姓名:谢凡荣
作者单位:南昌大学,数学系,南昌,330047
摘    要:本文给出了求变容量限制多阶段存储问题的最优存储方案的一个数值算法,证明了它的理论依据,并举例说明了算法的应用。该算法具有概念清楚、步骤明确、收敛性好、易于编程实现等优点,在存贮管理中有推广应用价值。

关 键 词:变容量限制多阶段存储问题  多阶段存储问题  最优存储方案
文章编号:1001-4926(2004)02-0034-04
收稿时间:2003-12-24
修稿时间:2003-12-24

Multi-stage Inventory Problem With different Capacity Limit in Different Stage and an Algorithm for Finding its Solution
XIE Fan- rong. Multi-stage Inventory Problem With different Capacity Limit in Different Stage and an Algorithm for Finding its Solution[J]. Journal of Nanchang Institute of Aeronautical Technology(Natural Science Edition), 2004, 18(2): 34-37
Authors:XIE Fan- rong
Affiliation:Mathematics Department, Nanchang University, Nanchang 330047, China
Abstract:multi- stage inventory problem with different capacity limit in different stage ;multi- stage inventory problem ; optimum inventory action.
Keywords:A numerical algorithm is presented for finding the optimum solution to the Multi - stage inventory problem with different capacity limitin different stage    and its theory is proved strictly . An example is given to demonstrate the use of the algorithm . The algorithm    which has the merits such as clear concept and procedure    good convergence   easy realization by copmputer- programming    and so on    is worthy to be widely applied in practical inventory management work.
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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