摘要
在给定时间范围内,研究了多种易变质产品的一次性联合订购决策,使库存系统总成本最小的问题.在允许缺货、库存空间和资金有约束的条件下,建立了此问题的数学模型并证明了该问题是一个凸规划问题.依据简约梯度法,给出了求解每种产品最优订购量的具体算法.最后,以三种易变质产品为例进行数值仿真,分别分析了相关参数以及总的库存空间和资金的变化对最优订购策略和系统最小总成本的影响.
The joint replenishment policies of multiple products were studied to minimize the system's total cost during a given time. A mathematical model was developed when space and investment constraints were considered and shortages were allowed in this case. This problem proved to be a convex programming. An algorithm to find the optimal ordering quality of each product was given based on the gradient method. A numeric example including three deteriorating products was studied and the influences on the optimal ordering quantities of each product and the minimal total cost which was caused by changes in its relevant parameter values, the total space and investment were analyzed.
出处
《兰州大学学报(自然科学版)》
CAS
CSCD
北大核心
2009年第6期136-142,共7页
Journal of Lanzhou University(Natural Sciences)
基金
国家自然科学基金项目(70501014)
中国矿业大学青年科研基金项目(2008A029)
中国矿业大学青年教师"启航计划"项目
关键词
库存模型
易变质产品
多种产品
简约梯度法
inventory model
deteriorating item
multi-item
reduced gradient method