Algorithm of logistic cost minimization under constraints on supply volumes

We study the problem of minimization of the delivery and storage cost of some product under constraints on product volumes delivered from every supplier. We show that the problem is pseudopolynomially solvable and propose an algorithm for solving this problem. Bibliography: 7 titles.
UDC 519.8 1 Statement of the Problem An enterprise consumes some product with intensity A. It demands P = T[lambda] units of the product in a time period T, which [...]