Concave Cost Supply Management for Single Manufacturing Unit

The considered problem consists of product delivery from a set of providers to the manufacturing units (single unit and single planning period in our case). The cost function is concave. Given the lower and upper bounds on the shipment size for each provider, the demand of the manufacturing unit has to be satisfied. In this chapter it is shown that this optimisation problem is NP-hard even to find a feasible solution to this problem. Considering the problem in integer programming formulation we propose a pseudo-polynomial algorithm, using the dynamic programming technique. Some possible approaches to solving the problem with multiple manufacturing units are discussed.