An integrated acquisition policy for supplier selection and lot sizing considering total quantity discounts and a quality constraint

•We consider a supplier selection problem in a finite planning horizon.•Suppliers offer total quantity discounts and the demand rate is constant.•We propose an algorithm to solve the problem considering integer order quantities.•Dynamic programming and Lagrangian relaxation provides near-optimal solutions.•Computational results show the algorithm is efficient, providing tight lower bounds.