A problem of minimization of delivery and storage costs of a product is considered under constraints on volumes of delivery from each of the suppliers. It is required to determine optimal volumes and times of product shipments. The problem is NP-hard. In this paper, the problem is proved to be pseudo-polynomially solvable and an algorithm for its solution is proposed.
@article{arxiv.1311.1055,
title = {An Algorithm of Logistic Costs Minimization Under Constraints on Supply Volumes},
author = {Natalia Burlakova and Vladimir Servakh},
journal= {arXiv preprint arXiv:1311.1055},
year = {2013}
}