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 |
| Summary: | 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. |
|---|---|
| ISSN: | 1848-0225 1848-9931 |