A model and algorithm for out-sourcing planning

This paper addresses a dynamic lot-sizing model with outsourcing. All the unsatisfied demands are out-sourced without backlogging, where the inventory capacity is limited and shortages are prohibited. Costs are concave and time varying. Some new properties are obtained in an optimal solution and a dynamic programming algorithm is developed to solve the problem in strongly polynomial time