Coordinated replenishments from multiple suppliers with price discounts Academic Article

abstract

• 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 Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean 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.

authors

• Shetty, Bala

published proceedings

• NAVAL RESEARCH LOGISTICS

author list (cited authors)

• Syam, S., & Shetty, B.

complete list of authors

• Syam, S||Shetty, B

publication date

• September 1998

publisher

• Wiley  Publisher

published in

• Naval Research Logistics  Journal

keywords

• Integer Programming
• Logistics
• Network Optimization

Digital Object Identifier (DOI)

• 10.1002/(SICI)1520-6750(199809)45:6<579::AID-NAV3>3.0.CO;2-#

start page

• 579

end page

• 598

volume

• 45

issue

• 6

URL

• http://dx.doi.org/10.1002/(sici)1520-6750(199809)45:6%3C579::aid-nav3%3E3.0.co;2-#