Allocating procurement to capacitated suppliers with concave quantity discounts Academic Article uri icon


  • 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. 2007 Elsevier B.V. All rights reserved.

published proceedings


author list (cited authors)

  • Burke, G. J., Geunes, J., Romeijn, H. E., & Vakharia, A.

citation count

  • 19

complete list of authors

  • Burke, Gerard J||Geunes, Joseph||Romeijn, H Edwin||Vakharia, Asoo

publication date

  • January 2008