Allocating procurement to capacitated suppliers with concave quantity discounts

被引：17
|
作者：
Burke, Gerard J. [2 ]
Geunes, Joseph [1 ]
Romeijn, H. Edwin [1 ]
Vakharia, Asoo [3 ]
机构：
[1] Univ Florida, Dept Ind & Syst Engn, Gainesville, FL 32611 USA
[2] Georgia So Univ, Dept Finance & Quantitat Anal, Statesboro, GA 30460 USA
[3] Univ Florida, Dept Informat Syst & Operat Management, Gainesville, FL 32611 USA
来源：
OPERATIONS RESEARCH LETTERS | 2008年 / 36卷 / 01期
基金：
美国国家科学基金会;
关键词：
knapsack problem; quantity discounts; nonlinear programming; approximation algorithms;
D O I：
10.1016/j.orl.2007.04.001
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：103 / 109
页数：7
相关论文
共 50 条
12345