Optimal requirement allocation among quantity-discount quoting suppliers

  • Gerard J. Burke
  • S. Selcuk Erenguc
  • Asoo J. Vakharia


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.


Supplier selection Supply chain management Quantity discounts 


  1. Benton WC, Park S (1996) A classification of literature on determining the lot size under quantity discounts. Eur J Oper Res 92:219–238CrossRefGoogle Scholar
  2. Burke G, Carrillo J, Vakharia AJ (2008a) Heuristics for sourcing from multiple suppliers with alternative quantity discounts. Eur J Oper Res 186:317–329CrossRefGoogle Scholar
  3. Burke G, Geunes J, Romeijn HE, Vakharia A (2008b) Allocating procurement to capacitated suppliers with concave quantity discounts. Oper Res Lett 36(1):103-109CrossRefGoogle Scholar
  4. Chauhaun SS, Proth J-M (2003) The concave cost supply problem. Eur J Oper Res 148:374–383CrossRefGoogle Scholar
  5. Chopra S, Sodhi MS (2004) Managing risk to avoid supply-chain breakdown. MIT Sloan Manag Rev Fall 46(1):53–61Google Scholar
  6. Elmaghraby W (2007) Auctions with E-sourcing events. Prod Oper Manag 16:409–422Google Scholar
  7. 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–80CrossRefGoogle Scholar
  8. Falk JE, Soland RM (1969) An algorithm for separable nonconvex programming problems. Manag Sci 15:550–569CrossRefGoogle Scholar
  9. Nahmias S (2001) Production and operations analysis, 4th edn. McGraw, New YorkGoogle Scholar
  10. Rubin PA, Benton WC (2003) Evaluating jointly constrained order quantity complexities for incremental discounts. Eur J Oper Res 149:557–570CrossRefGoogle Scholar
  11. Shectman JP, Sahinidis NV (1998) A algorithm for global minimization of separable concave programs. J Global Optim 12:1–36CrossRefGoogle Scholar
  12. Verma R, Pullman ME (1998) An analysis of the supplier selection process. Omega: The Int J Manag Sci 26:739–750CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Gerard J. Burke
    • 1
  • S. Selcuk Erenguc
    • 2
  • Asoo J. Vakharia
    • 2
  1. 1.Department of Finance and Quantitative Analysis, College of Business AdministrationGeorgia Southern UniversityStatesboroUSA
  2. 2.Department of Information Systems and Operations Management, Warrington College of Business AdministrationUniversity of FloridaGainesvilleUSA

Personalised recommendations