Optimization
回答済み
Hello,
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 !
Ibtissam
-
正式なコメント
-
Gurobi Staff
This post is more than three years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum. Or why not try our AI Gurobot?. -
-
-
Hello Ibtissam,
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.
Regards
0 -
投稿コメントは受け付けていません。
コメント
2件のコメント