In this note, we reduce an instance of the partition problem to a dynamic lot sizing problem in polynomial time, and show that solving the latter problem solves the former problem. We further show that the instance of the partition problem can be solved using polynomial number of addition, multiplication and sort operations in input data using the reduction.

翻译：本文中，我们在多项式时间内将划分问题的一个实例归约为动态批量规划问题，并证明求解后者即可解决前者。我们进一步表明，通过该归约方法，划分问题的实例可以利用输入数据的多项式次加法、乘法和排序运算求解。