hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.17535/crorr.2018.0007

A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game

Gökhan Özçelik ; Faculty of Engineering, Karadeniz Technical University, Trabzon, Turkey
Cevriye Gencer ; Faculty of Engineering, Gazi University, Ankara, Turkey

Puni tekst: engleski, pdf (2 MB) str. 75-85 preuzimanja: 176* citiraj
APA 6th Edition
Özçelik, G. i Gencer, C. (2018). A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game. Croatian Operational Research Review, 9 (1), 75-85. https://doi.org/10.17535/crorr.2018.0007
MLA 8th Edition
Özçelik, Gökhan i Cevriye Gencer. "A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game." Croatian Operational Research Review, vol. 9, br. 1, 2018, str. 75-85. https://doi.org/10.17535/crorr.2018.0007. Citirano 31.07.2021.
Chicago 17th Edition
Özçelik, Gökhan i Cevriye Gencer. "A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game." Croatian Operational Research Review 9, br. 1 (2018): 75-85. https://doi.org/10.17535/crorr.2018.0007
Harvard
Özçelik, G., i Gencer, C. (2018). 'A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game', Croatian Operational Research Review, 9(1), str. 75-85. https://doi.org/10.17535/crorr.2018.0007
Vancouver
Özçelik G, Gencer C. A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game. Croatian Operational Research Review [Internet]. 2018 [pristupljeno 31.07.2021.];9(1):75-85. https://doi.org/10.17535/crorr.2018.0007
IEEE
G. Özçelik i C. Gencer, "A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game", Croatian Operational Research Review, vol.9, br. 1, str. 75-85, 2018. [Online]. https://doi.org/10.17535/crorr.2018.0007

Sažetak
The paper investigates a procurement game between two rival firms considered as a network interdiction problem (NIP) where an interdictor, using limited interdiction budget, interdicts the node of supplier(s) on a capacitated single echelon multi products supply chain and tries to explicitly maximize the minimum procurement cost of a defender. In the study, a goal programming model is proposed to prevent the situations where the budget is used unnecessary (wasted budget) out of discrete interdiction variable.

Ključne riječi
supplier interdiction; procurement game; network interdiction; integer programming

Hrčak ID: 203895

URI
https://hrcak.srce.hr/203895

Posjeta: 372 *