A Branch-and-Bound Algorithm for the Concave Cost Supply ProblemInternational Journal of Production Research
AbstractEffective supplier selection and allocation of order quantity among multiple suppliers are indispensable to the success of a manufacturing company. While companies have begun to turn into a comprehensive multi-criteria approach, most buyers still consider purchasing cost to be their primary concern in selecting their suppliers. In this paper, we consider the concave cost supply problem where a manufacturer seeks to select the suppliers and simultaneously procure the quantity of material/component required for production at the minimum total cost during a standard production period. We provide and validate an effective and efficient branch-and-bound algorithm that is finite and that finds the global optimal solution of the problem without any restrictions on the cost functions or on the set of input parameters used in the problem. Numerical experiments are conducted to evaluate the performance of the proposed algorithm.
Citation InformationArda Yenipazarli, Harold P. Benson and S. Selcuk Erenguc. "A Branch-and-Bound Algorithm for the Concave Cost Supply Problem" International Journal of Production Research Vol. 54 Iss. 13 (2016) p. 3943 - 3961
Available at: http://works.bepress.com/arda_yenipazarli/39/