Improved produce-storage problem algorithm based on dynamic programming

In this paper,the produce-storage problem is discussed,and a theorem is proposed based on linear algebraic theory.Then a new algorithm based on dynamic programming is proposed through improving the step-length.Finally,the complexity of the algorithm is analyzed.