Allocating Procurement to Capacitated Suppliers with Concave Quantity Discounts

Authors

Gerard J. Burke, Georgia Southern UniversityFollow
Joseph Geunes, University of Florida
H. Edwin Romejin, University of Florida
Asoo J. Vakharia, University of Florida

Document Type

Article

Publication Date

1-2008

Publication Title

Operations Research Letters

DOI

10.1016/j.orl.2007.04.001

ISSN

0167-6377

Abstract

We consider a procurement problem where suppliers offer concave quantity discounts. The resulting continuous knapsack problem involves the minimization of a sum of separable concave functions. We identify polynomially solvable special cases of this NP-hard problem, and provide a fully polynomial-time approximation scheme for the general problem.

Recommended Citation

Burke, Gerard J., Joseph Geunes, H. Edwin Romejin, Asoo J. Vakharia. 2008. "Allocating Procurement to Capacitated Suppliers with Concave Quantity Discounts." Operations Research Letters, 36 (1): 103-109. doi: 10.1016/j.orl.2007.04.001 source: https://link.springer.com/article/10.1007%2Fs12063-008-0003-1
https://digitalcommons.georgiasouthern.edu/logistics-supply-facpubs/18