摘要
对多品种有约束的存贮论问题 ,传统的存贮模型是通过给每一种货物假设一个决策变量 (定货时间或定货量 )再用 Kuhn- Tucker条件求得“最优解”,实际上这样的结果并非最优解。它存在着订货次数过多、资源利用率低、总费用过高等缺点。本文通过对时间的有效切割入手 ,建立了一非线性整数规划模型比较好地解决了这一问题。本文在提出新的方法的同时 。
The traditional method in dealing with multi item constrained inventory issue has been to assign a decision variable, such as ordering quantity or ordering time, to each of the item and then to use Kuhn Tucker condition to reach an 'optimal' solution. We have proved, in a different paper, that such a solution is not optimal. It leads to less efficient utilization of resources, higher total cost and more frequent orders. This paper presents a better solution by using Non Linear Integer Programming method. In addition to a new method, the paper also made a thorough comparison among the new method, the traditional multi item constrained model and non constrained model.
出处
《系统工程》
CSCD
北大核心
2002年第4期15-19,共5页
Systems Engineering
基金
中国科学院"百人计划"资金资助项目
