Dynamic lot sizing with multiple suppliers, backlogging and quantity discounts

This paper studies the dynamic lot sizing problem with supplier selection, backlogging and quantity discounts. Two known discount types are considered separately, incremental and all-units quantity discounts. Mixed integer linear programming (MILP) formulations are presented for each case and solved using a commercial optimization software. In order to timely solve the problem, a recursive formulation and its efficient implementation are introduced for each case which result in an optimal and a near optimal solution for incremental and all-units quantity discount cases, respectively. Finally, the execution times of the MILP models and forward dynamic programming models obtained from the recursive formulations are presented and compared. The results demonstrate the efficiency of the dynamic programming models, as they can solve even large-sized instances quite timely. © 201