存储场地有限制的经济订购模型的一种优化方法

An Optimum Method of Economical Ordering Model with Limited Storage Space

对于采购资金和存储场地等有一定限制条件的经济订购模型 ,目前一般采用拉格朗日乘子法求解 .本文用可行方向法运用计算机求解存储场地有限制的订购模型 .该方法具有结果精确、运算速度快、适应多种限制条件的存储问题等特点 。

In this paper, a feasible direction method is used to resolve problems of which the storage space is limited, the least quantity of purchase is no less than the starting point and different goods must be placed separately. It has more practical significance than Lagrange multiplier method which can only resolve problems under ideal conditions. This paper has not only explained the rationality of the method theoretically, but also given algorithms and examples.