Allocating procurement to capacitated suppliers with concave quantity discounts

Authors:
Gerard J. Burke;Joseph Geunes;H. Edwin Romeijn;Asoo Vakharia
Affiliations:
Department of Finance and Quantitative Analysis, Georgia Southern University, Statesboro, GA 30460, USA;Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA;Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA;Department of Information Systems and Operations Management, University of Florida, Gainesville, FL 32611, USA
Venue:
Operations Research Letters
Year:
2008

Citing 6
Cited 0

Methods for global concave minimization: A bibliographic survey

SIAM Review
Constrained global optimization: algorithms and applications

Constrained global optimization: algorithms and applications
On the solution of concave knapsack problems

Mathematical Programming: Series A and B
Channel coordination and quantity discounts

Management Science
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

Mathematics of Operations Research
On a nonseparable convex maximization problem with continuous knapsack constraints

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.