.png){kind=icon}
.png){kind=icon}
Return
A branch-and-bound algorithm for the concave cost supply problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2016.1165358.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
supply management
concave cost
global optimisation
branch and bound
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W