【摘要】 多级多工件的生产计划是一种强耦合的整数规划问题，一般的数学方法无法解决这种大中规模问题．使用可行域变换的方法，可使可行域变得较紧，这样最优解的搜索就可以更有效地进行．本文给出了多级多工件问题的变换方法及最优解的等价证明；并验证了算法的有效性．更多还原

【Abstract】 The multi item multi level capacitated lot sizing is a great scaled mixed integer programming problem.It is too difficult to use the common methods to solve the problem.We show that the domain transformation method can greatly reduce the original problem scale.A more efficient method can be applied to the new problem. The proof of the equivalence of the two problem solutions is given in this paper.And several cases are researched using this method.更多还原