ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Winner Determination in Multi-unit Procurement Auctions with Volume Discount Bids and Lead Time Constraints

Verma, DK and Hemachandra, N and Narahari, Y and Tew, JD (2014) Winner Determination in Multi-unit Procurement Auctions with Volume Discount Bids and Lead Time Constraints. [Book Chapter]

[img] PDF
spr_ser_adv_289-315_2014.pdf - Published Version
Restricted to Registered users only

Download (456kB) | Request a copy
Official URL: https://doi.org/10.1007/978-1-4471-5295-8_13


In this chapter, we consider the problem of determining an optimal set of winning suppliers in a procurement auction where the buyer wishes to procure high volumes of a homogeneous item in a staggered way in accordance with a predefined schedule and the suppliers respond with bids that specify volume discounts and also delivery lead times. We show that the winner determination problem, which turns out to be a multi-objective optimization problem, cannot be satisfactorily solved by traditional methods of multi-objective optimization. We formulate the problem first as an integer program with constraints capturing lead time requirements and show that the integer program is an extended version of the multiple knapsack problems. We discover certain properties of this integer program and exploit the properties to simplify it to a 0–1 mixed integer program (MIP), which can be solved more efficiently. We next explore a more efficient approach to solving the problem using a linear relaxation of the 0–1 MIP in conjunction with a greedy heuristic. Using extensive numerical experimentation, we show the efficacy of the 0–1 MIP and the proposed heuristic.

Item Type: Book Chapter
Publication: Springer Series in Advanced Manufacturing
Publisher: Springer Nature
Additional Information: The copyright for this article belongs to Springer Nature.
Keywords: Integer program (IP); Knapsack problem (KP); Lead time constraints; Mixed 0–1 integer program (0–1 MIP); Multi-attribute auctions (MAA); Procurement auctions; Supply curve (SC); Volume discount auctions (VDA)
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 04 May 2023 09:19
Last Modified: 04 May 2023 09:19
URI: https://eprints.iisc.ac.in/id/eprint/81407

Actions (login required)

View Item View Item