I have a question about an optimization problem and I don't know if it is the right place to ask.
The problem is to optimize more specifically minimize a quantity that is a combination of binary (offloading decisions) and real variables (resource allocations). The problem is NP Hard and computationally intractable.
A way I see to solve it, is : To decompose the problem into 2 sub-problems :
- One sub-problem that will first tackle the binary nature of the optimization by : Hierarchically determine the tasks to be offloaded ( according to a priority metric) : Tasks for which the binary variable is 1.
- A second sub-problem that will take care of allocating resources to tasks for which the binary variable is equal to 1.
If you have any other suggestions for algorithms or comments on what I propose It will be helpful !
this is too generic of a question to give a concrete answer, but given that you are starting "from scratch" I suggest you look at a few of our modelling examples discussed here, https://www.gurobi.com/resource/modeling-examples/
Generally speaking, it sounds you are exactly in the MIP-Gurobi territory though.
Hope this helps, at least a little.
Please sign in to leave a comment.