A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game
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 maximiz...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Croatian Operational Research Society
2018-01-01
|
Series: | Croatian Operational Research Review |
Online Access: | http://hrcak.srce.hr/file/300105 |
id |
doaj-a38f5bc1def84b1583e810230f68f40c |
---|---|
record_format |
Article |
spelling |
doaj-a38f5bc1def84b1583e810230f68f40c2020-11-25T00:11:05ZengCroatian Operational Research SocietyCroatian Operational Research Review1848-02251848-99312018-01-0191758510.17535/crorr.2018.0007203895A goal programming model that ensures efficient usage of limited interdiction budget in the procurement gameGökhan Özçelik0Cevriye Gencer1Faculty of Engineering, Karadeniz Technical University, Trabzon, TurkeyFaculty of Engineering, Gazi University, Ankara, TurkeyThe 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.http://hrcak.srce.hr/file/300105 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Gökhan Özçelik Cevriye Gencer |
spellingShingle |
Gökhan Özçelik Cevriye Gencer A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game Croatian Operational Research Review |
author_facet |
Gökhan Özçelik Cevriye Gencer |
author_sort |
Gökhan Özçelik |
title |
A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game |
title_short |
A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game |
title_full |
A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game |
title_fullStr |
A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game |
title_full_unstemmed |
A goal programming model that ensures efficient usage of limited interdiction budget in the procurement game |
title_sort |
goal programming model that ensures efficient usage of limited interdiction budget in the procurement game |
publisher |
Croatian Operational Research Society |
series |
Croatian Operational Research Review |
issn |
1848-0225 1848-9931 |
publishDate |
2018-01-01 |
description |
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. |
url |
http://hrcak.srce.hr/file/300105 |
work_keys_str_mv |
AT gokhanozcelik agoalprogrammingmodelthatensuresefficientusageoflimitedinterdictionbudgetintheprocurementgame AT cevriyegencer agoalprogrammingmodelthatensuresefficientusageoflimitedinterdictionbudgetintheprocurementgame AT gokhanozcelik goalprogrammingmodelthatensuresefficientusageoflimitedinterdictionbudgetintheprocurementgame AT cevriyegencer goalprogrammingmodelthatensuresefficientusageoflimitedinterdictionbudgetintheprocurementgame |
_version_ |
1725405284795416576 |