Abstract
We consider a problem motivated by a central purchasing organization for a major office products distributor. This purchasing organization must source a quantity of a particular resale item from a set of capacitated suppliers. In our case each supplier offers an incremental quantity discount purchase price structure. The purchaser’s objective is to obtain a quantity of a required item at minimum cost. The resulting problem is one of allocating order quantities among an approved supply base and involves minimizing the sum of separable piecewise linear concave cost functions. We develop a branch and bound algorithm that arrives at an optimal solution by generating linear knapsack subproblems with feasible solutions to the original problem.
Similar content being viewed by others
References
Benton WC, Park S (1996) A classification of literature on determining the lot size under quantity discounts. Eur J Oper Res 92:219–238
Burke G, Carrillo J, Vakharia AJ (2008a) Heuristics for sourcing from multiple suppliers with alternative quantity discounts. Eur J Oper Res 186:317–329
Burke G, Geunes J, Romeijn HE, Vakharia A (2008b) Allocating procurement to capacitated suppliers with concave quantity discounts. Oper Res Lett 36(1):103-109
Chauhaun SS, Proth J-M (2003) The concave cost supply problem. Eur J Oper Res 148:374–383
Chopra S, Sodhi MS (2004) Managing risk to avoid supply-chain breakdown. MIT Sloan Manag Rev Fall 46(1):53–61
Elmaghraby W (2007) Auctions with E-sourcing events. Prod Oper Manag 16:409–422
Erenguc SS, Tufekci S (1987) A branch and bound algorithm for a single-item multi-source dynamic lot sizing problem with capacity constraints. IIE Trans 19(1):73–80
Falk JE, Soland RM (1969) An algorithm for separable nonconvex programming problems. Manag Sci 15:550–569
Nahmias S (2001) Production and operations analysis, 4th edn. McGraw, New York
Rubin PA, Benton WC (2003) Evaluating jointly constrained order quantity complexities for incremental discounts. Eur J Oper Res 149:557–570
Shectman JP, Sahinidis NV (1998) A algorithm for global minimization of separable concave programs. J Global Optim 12:1–36
Verma R, Pullman ME (1998) An analysis of the supplier selection process. Omega: The Int J Manag Sci 26:739–750
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by a 2007 Summer Research Grant awarded to Asoo J. Vakharia.
Appendix: Proof of Result 1
Appendix: Proof of Result 1
(SPLCCAP) is a concave minimization problem over a bounded polyhedron, D ∩ C. Therefore, there exists at least one optimal solution which is an extreme point of D ∩ C. The set D ∩ C consists of a knapsack constraint with bounded variables. It is a well known fact that the extreme points of D ∩ C are characterized by having at most one variable q i such that \(0< q_i<u_{iK_i}\) and all other variables either at their lower or upper bound. Therefore, it then follows that there exists at least one optimal solution to (SPLCCAP) such that there is at most one supplier j for which \(0<q_j<u_{jK_j}\) and for all other suppliers (i ≠ j) q i = 0 or \(q_i=u_{iK_i}\).
Rights and permissions
About this article
Cite this article
Burke, G.J., Erenguc, S.S. & Vakharia, A.J. Optimal requirement allocation among quantity-discount quoting suppliers. Oper Manag Res 1, 53–60 (2008). https://doi.org/10.1007/s12063-008-0003-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12063-008-0003-1