Capacitated lot-sizing problem with outsourcing

We study a capacitated lot-sizing problem with outsourcing, in which the production capacity is constant and the outsourcing is uncapacitated. In each period, the demand can be satisfied by both production and outsourcing. We develop a dynamic programming-based algorithm to solve this problem in polynomial time.