This function calculates the optimal number of orders and the associated cost in the inventory transportation system when agents are cooperating.

1 |

`n` |
Agents in the inventory situation. |

`a` |
The fixed cost per order. |

`av` |
Vector. The transportations cost per order to each agent. |

`d` |
Vector. Deterministic demands per time unit to each agent. |

`h` |
Vector. Holding cost per time unit to each agent. |

`m` |
Vector. Number of orders to each agent (optional). |

A list with the following components:

`Optimal order`

A matrix with all possible coalitions in the first column. The next*n*columns contain the associated cost to each agent in the coalition. Last column indicates the global cost of the optimal order.

1 2 3 4 5 6 7 8 9 10 11 12 | ```
STIcoo(n=3,a=200,av=c(300,300,900),d=c(90,80,20),h=c(0.06,0.06,0.1),m=NA)
#$"Optimal order"
# 1 2 3 Coalition Order cost
# 0.0000 0.000 0.0000 0 0.00000
# 1224.7449 0.000 0.0000 1 73.48469
# 0.0000 1154.701 0.0000 2 69.28203
# 0.0000 0.000 663.3250 3 66.33250
# 891.1328 792.118 0.0000 12 100.99505
# 1551.8080 0.000 344.8462 13 127.59310
# 0.0000 1438.954 359.7385 23 122.31108
# 1208.5759 1074.290 268.5724 123 163.82918
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.