A branch-and-bound algorithm for the concave cost supply problem

Arda Yenipazarli, Harold P. Benson and Selcuk Erenguc

International Journal of Production Research, 2016, vol. 54, issue 13, 3943-3961

Abstract: Effective 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.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2016.1165358 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:54:y:2016:i:13:p:3943-3961

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2016.1165358

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().