Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity

Chee-Khian Sim

In this note, we polynomially reduce an instance of the partition problem to a dynamic lot sizing problem, and show that solving the latter problem solves the former problem. By so…