Optimal requirement allocation among quantity-discount quoting suppliers
- Citation data:
Operations Management Research, ISSN: 1936-9735, Vol: 1, Issue: 1, Page: 53-60
- Publication Year:
- Repository URL:
- https://digitalcommons.georgiasouthern.edu/logistics-supply-facpubs/16; https://works.bepress.com/gerard_j_burke/43
- Business, Management and Accounting; Decision Sciences; Engineering; Supplier selection; Supply chain management; Quantity discounts; Business Administration, Management, and Operations; Operations and Supply Chain Management; Academic Units, Business, Logistics & Supply Chain Management, Faculty Publications
We consider a problem motivated by a central purchasing organization for a major office products distributor. This purchasing organization must source a quantity of a particular resale item from a set of capacitated suppliers. In our case each supplier offers an incremental quantity discount purchase price structure. The purchaser's objective is to obtain a quantity of a required item at minimum cost. The resulting problem is one of allocating order quantities among an approved supply base and involves minimizing the sum of separable piecewise linear concave cost functions. We develop a branch and bound algorithm that arrives at an optimal solution by generating linear knapsack subproblems with feasible solutions to the original problem. © Springer Science+Business Media, LLC 2008.