| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143210 | Operations Research Letters | 2008 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gerard J. Burke, Joseph Geunes, H. Edwin Romeijn, Asoo Vakharia,