CAJ | 학술논문

在给定时间范围内,研究了多种易变质产品的一次性联合汀购决策,使库存系统总成本最小的问题.在允许缺货、库存空间和资金有约束的条件下,建立了此问题的数学模型并证明了该问题是一个凸规划问题.依据简约梯度法,给出了求解每种产品最优订购量的具体算法.最后,以三种易变质产品为例进行数值仿真,分别分析了相关参数以及总的库存空间和资金的变化对最优订购策略和系统最小总成本的影响.
재급정시간범위내,연구료다충역변질산품적일차성연합정구결책,사고존계통총성본최소적문제.재윤허결화、고존공간화자금유약속적조건하,건립료차문제적수학모형병증명료해문제시일개철규화문제.의거간약제도법,급출료구해매충산품최우정구량적구체산법.최후,이삼충역변질산품위례진행수치방진,분별분석료상관삼수이급총적고존공간화자금적변화대최우정구책략화계통최소총성본적영향.
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.