Capacitated Multiple Item Ordering Problem with Quantity Discounts

Abstract

Abstract Purchasing managers face a complex problem when determining order quantities for multiple items in the presence of quantity discounts and resource limitations. In this paper, the problem is formulated as a mathematical programming model. An efficient solution algorithm is developed utilizing the Lagrangian relaxation approach. Extensive computational experiments are performed and the results are presented.