Initial feasible solution for Linear Optimization
進行中I want to use Gurobi in Julia Jump to solve a linear optimization and using primal simplex method, and I have a good guess of optimal solution denoted as X_init, so I set a starting value for the model. However the solver still takes a long time to solve the problem and seems does not use any initial value information. Did I make any mistakes here? Thank you.
Here is my sample code:
m =Model(Gurobi.Optimizer);
@variable(m, X[1:N,1:N] >= 0, Symmetric);
set_start_value.(X, X_init);
set_attribute(m, "LPWarmStart", 1);
set_attribute(m, "Method", 1);
@constraint(m, ...)
@objective(m, ...)
optimize!(m)
0
-
正式なコメント
This post is more than two 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 try Gurobot, our chatbot interface offering instant, expert-level support. -
Hi,
Could you write Gurobi's logs? There might be more information there regarding the use of warm start, information about your model and how it is solving your LP.
0
投稿コメントは受け付けていません。
コメント
2件のコメント