A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game
CROATIAN OPERATIONAL RESEARCH REVIEW, cilt.9, sa.1, ss.75-85, 2018 (ESCI, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 9 Sayı: 1
- Basım Tarihi: 2018
- Doi Numarası: 10.17535/crorr.2018.0007
- Dergi Adı: CROATIAN OPERATIONAL RESEARCH REVIEW
- Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus
- Sayfa Sayıları: ss.75-85
- Açık Arşiv Koleksiyonu: AVESİS Açık Erişim Koleksiyonu
- Gazi Üniversitesi Adresli: Evet
Özet
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.