Allocating procurement to capacitated suppliers with concave quantity discounts Academic Article

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

authors

• Geunes, Joseph

published proceedings

• OPERATIONS RESEARCH LETTERS

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

publisher

• Elsevier  Publisher

published in

• Operations Research Letters  Journal

keywords

• Approximation Algorithms
• Knapsack Problem
• Nonlinear Programming
• Quantity Discounts

Digital Object Identifier (DOI)

• 10.1016/j.orl.2007.04.001

start page

• 103

end page

• 109

volume

• 36

issue

• 1

URL

• http://dx.doi.org/10.1016/j.orl.2007.04.001