Coordinated Replenishments with Multiple Suppliers and Price Discounts
Format of Original
Naval Research Logistics
In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangian dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangian multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998
Syam, Siddhartha and Shetty, Bala, "Coordinated Replenishments with Multiple Suppliers and Price Discounts" (1998). Management Faculty Research and Publications. 114.