Question:
Can you solve the "goat cabbage wolf" problem using integer programming.
If so could I get an outline of the solution or a reference to one?
Question:
Can you solve the "goat cabbage wolf" problem using integer programming.
If so could I get an outline of the solution or a reference to one?
Copyright © 2021 JogjaFile Inc.
OK, I'll bite.
I could implement this using the concept of 'inventory'. After each trip we have: $$ inv_{trip,side,item} = inv_{trip-1,side,item} + delivered_{trip,side,item} - takenaway_{trip,side,item} $$ We also have initial inventory and required final inventory. The equations look like:
The equations to forbid certain configurations are similar to what I suggested here.
The main decisions looks like: