| Article ID: | iaor2009318 |
| Country: | Netherlands |
| Volume: | 36 |
| Issue: | 1 |
| Start Page Number: | 103 |
| End Page Number: | 109 |
| Publication Date: | Jan 2008 |
| Journal: | Operations Research Letters |
| Authors: | Romeijn H. Edwin, Geunes Joseph, Burke Gerard J., Vakharia Asoo |
| Keywords: | knapsack problem, discounts |
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.