Optimal supplier choice with discounting / Goldengorin, B. in Journal of the operational research society (JORS), Vol. 62 N° 4 (Avril 2011)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 62 N° 4 (Avril 2011) . - pp. 690–699 Titre : Optimal supplier choice with discounting Type de document : texte imprimé Auteurs : Goldengorin, B., Auteur ; Keane, J., Auteur ; Kuzmenko, V., Auteur Année de publication : 2011 Article en page(s) : pp. 690–699 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Allocation Decision support systems Integer programming Location Index. décimale : 001.424 Résumé : This paper investigates a model for pricing the demand for a set of goods when suppliers operate discount schedules based on total business value. We formulate the buyers's decision problem as a mixed binary integer program, which is a generalization of the capacitated facility location problem (CFLP). A branch and bound (BnB) procedure using Lagrangean relaxation and subgradient optimization is developed for solving large-scale problems that can arise when suppliers’ discount schedules contain multiple price breaks. Results of computer trials on specially adapted large benchmark instances of the CFLP confirm that a sub-gradient optimization procedure based on Shor and Zhurbenko's r-algorithm, which employs a space dilation in the direction of the difference between two successive subgradients, can be used efficiently for solving the dual problem at any node of the BnB tree. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n4/abs/jors2009164a.html [article] Optimal supplier choice with discounting [texte imprimé] / Goldengorin, B., Auteur ; Keane, J., Auteur ; Kuzmenko, V., Auteur . - 2011 . - pp. 690–699. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 4 (Avril 2011) . - pp. 690–699 Mots-clés : Allocation Decision support systems Integer programming Location Index. décimale : 001.424 Résumé : This paper investigates a model for pricing the demand for a set of goods when suppliers operate discount schedules based on total business value. We formulate the buyers's decision problem as a mixed binary integer program, which is a generalization of the capacitated facility location problem (CFLP). A branch and bound (BnB) procedure using Lagrangean relaxation and subgradient optimization is developed for solving large-scale problems that can arise when suppliers’ discount schedules contain multiple price breaks. Results of computer trials on specially adapted large benchmark instances of the CFLP confirm that a sub-gradient optimization procedure based on Shor and Zhurbenko's r-algorithm, which employs a space dilation in the direction of the difference between two successive subgradients, can be used efficiently for solving the dual problem at any node of the BnB tree. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n4/abs/jors2009164a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire