Benders-based winner determination algorithm for volume discount procurement auctions
by S. Kameshwaran, Y. Narahari
International Journal of Logistics Systems and Management (IJLSM), Vol. 5, No. 1/2, 2009

Abstract: This paper considers an industrial procurement of large volume of a single good, such as a raw material or a subcomponent. The procurement is implemented using volume discount auctions, in which the bids are nonconvex piecewise linear cost functions. The winner determination problem faced by the buyer is an NP-hard nonlinear knapsack problem. We propose a mixed integer linear formulation for the problem which has the following primal structure: if the integer variables are fixed at some feasible values, then solving the remaining linear variables is a continuous knapsack problem. Exploiting this feature, Benders' decomposition algorithm is developed and various techniques are proposed to accelerate the convergence of the algorithm. Experimental results for the random test data show the efficacy of the accelerating techniques.

Online publication date: Sun, 30-Nov-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email