We develop an algorithm that solves the constant capacities economic lot-sizing problem with concave production costs and linear holding in O(T³) time. The algorithm is based on the standard dynamic programming approach which requires the computation of the minimal costs for all possible...