Reverse auction with buyer-supplier negotiation using bi-level distributed programming
AbstractThis study presents a framework for solving a sealed-bid, multi-issue, and multi-sourcing reverse auction problem in which negotiation takes place between the buyer and the suppliers during the bidding process. The problem is formulated as a bi-level distributed programming model in which the buyer is the upper level decision maker, while suppliers at the lower level make decisions independent of each other. The negotiation process between the buyer and the suppliers is facilitated via the iterative exchange of decision information between the upper and lower levels of the model. The outcome of the sealed-bid auction is determined using an algorithm designed to establish the optimum quantity allocation and delivery time at the upper level and the corresponding optimized production plans at the lower level. The feasibility of the proposed approach is demonstrated via an illustrative example.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 211 (2011)
Issue (Month): 3 (June)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Auctions/bidding Available to promise inventory Bi-level distributed programming Negotiation Fuzzy mathematical programming;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Teich, Jeffrey E. & Wallenius, Hannele & Wallenius, Jyrki & Zaitsev, Alexander, 2006. "A multi-attribute e-auction mechanism for procurement: Theoretical foundations," European Journal of Operational Research, Elsevier, vol. 175(1), pages 90-100, November.
- Kingsman, Brian & Hendry, Linda & Mercer, Alan & de Souza, Antonio, 1996. "Responding to customer enquiries in make-to-order companies Problems and solutions," International Journal of Production Economics, Elsevier, vol. 46(1), pages 219-231, December.
- Bichler, Martin & Kalagnanam, Jayant, 2005. "Configurable offers and winner determination in multi-attribute auctions," European Journal of Operational Research, Elsevier, vol. 160(2), pages 380-394, January.
- Teich, Jeffrey E. & Wallenius, Hannele & Wallenius, Jyrki & Koppius, Otto R., 2004. "Emerging multiple issue e-auctions," European Journal of Operational Research, Elsevier, vol. 159(1), pages 1-16, November.
- R. E. Bellman & L. A. Zadeh, 1970. "Decision-Making in a Fuzzy Environment," Management Science, INFORMS, vol. 17(4), pages B141-B164, December.
- Cakravastia, Andi & Toha, Isa S. & Nakamura, Nobuto, 2002. "A two-stage model for the design of supply chain networks," International Journal of Production Economics, Elsevier, vol. 80(3), pages 231-248, December.
- Easton, Fred F. & Moodie, Douglas R., 1999. "Pricing and lead time decisions for make-to-order firms with contingent orders," European Journal of Operational Research, Elsevier, vol. 116(2), pages 305-318, July.
- Pramanik, Surapati & Roy, Tapan Kumar, 2007. "Fuzzy goal programming approach to multilevel programming problems," European Journal of Operational Research, Elsevier, vol. 176(2), pages 1151-1166, January.
- Damian R. Beil & Lawrence M. Wein, 2003. "An Inverse-Optimization-Based Auction Mechanism to Support a Multiattribute RFQ Process," Management Science, INFORMS, vol. 49(11), pages 1529-1545, November.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.