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
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
Datum izdavanja:
24.7.2018.
Posjeta: 832 *