Allocating Procurement to Capacitated Suppliers with Concave Quantity Discounts

Gerard J. Burke; Joseph Geunes; H. Edwin Romeijn; Asoo Vakharia

doi:10.1016/j.orl.2007.04.001

Allocating Procurement to Capacitated Suppliers with Concave Quantity Discounts

Gerard J. Burke, Joseph Geunes, H. Edwin Romeijn, Asoo Vakharia

Logistics & Supply Chain Management

University of Florida

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

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.

Original language	American English
Journal	Operations Research Letters
Volume	36
DOIs	https://doi.org/10.1016/j.orl.2007.04.001
State	Published - Jan 1 2008

Keywords

Approximation algorithms
Knapsack problem
Nonlinear programming
Quantity discounts

DC Disciplines

Operations and Supply Chain Management
Business Administration, Management, and Operations

Access to Document

10.1016/j.orl.2007.04.001License: Unspecified

https://dx.doi.org/10.1016/j.orl.2007.04.001

Cite this

@article{5844fe3b21dd42abac0780e9c55401df,

title = "Allocating Procurement to Capacitated Suppliers with Concave Quantity Discounts",

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.",

keywords = "Approximation algorithms, Knapsack problem, Nonlinear programming, Quantity discounts",

author = "Burke, {Gerard J.} and Joseph Geunes and {Edwin Romeijn}, H. and Asoo Vakharia",

year = "2008",

month = jan,

day = "1",

doi = "10.1016/j.orl.2007.04.001",

language = "American English",

volume = "36",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Allocating Procurement to Capacitated Suppliers with Concave Quantity Discounts

AU - Burke, Gerard J.

AU - Geunes, Joseph

AU - Edwin Romeijn, H.

AU - Vakharia, Asoo

PY - 2008/1/1

Y1 - 2008/1/1

N2 - 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.

AB - 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.

KW - Approximation algorithms

KW - Knapsack problem

KW - Nonlinear programming

KW - Quantity discounts

UR - https://digitalcommons.georgiasouthern.edu/logistics-supply-facpubs/18

UR - https://dx.doi.org/10.1016/j.orl.2007.04.001

U2 - 10.1016/j.orl.2007.04.001

DO - 10.1016/j.orl.2007.04.001

M3 - Article

SN - 0167-6377

VL - 36

JO - Operations Research Letters

JF - Operations Research Letters

ER -

Allocating Procurement to Capacitated Suppliers with Concave Quantity Discounts

Abstract

Keywords

DC Disciplines

Access to Document

Other files and links

Fingerprint

Cite this