Jaromił Najman

Hi, You can compute the MIPGap in a \(\texttt{where=MIP}\) callback by retrieving the \(\texttt{MIP_OBJBST}\) and \(\texttt{MIP_OBJBND}\) and use the formula shown in this Knowledge Base article. P...

Hi Robert, From the logs, it seems like the BestBd can be improved only if a good enough incumbent has been found. Could you try a run with MIPFocus set to 1? I see you dropped ~10k constraints to ...

Hi Robert, It is currently not possible to pass a lower bound (or in case of maximization an upper bound) to Gurobi. Please have a look at this post and this one for a detailed explanation of why t...

Hi Robert, You can provide the solution found in the relaxed version of your model as an initial solution, see MIP starts and Parameter Start. If you want Gurobi to focus on finding feasible soluti...

Dear Tao, It is possible by, e.g., executing the command gurobi_cl --tokens. You can find the full documentation on this feature with additional examples in our knowledge base article How can I che...

Dear Umair, Ok, so you applied the Affine Form of Farkas Lemma to get rid of quantifiers and this resulted in many bilinear terms. Did you try formulating the logic quantifiers via the introduction...

Hi Sagnik, I understand. This can still be done efficiently as you are interested in the trace only. When you perform the multiplication of \(A^T B A = M\), you see that the diagonal elements of \(...

Hi, Non-convex problems don't have to be large to be challenging.I have written your problem to an \(\texttt{LP}\) file by using the Model.write() function and am referring to the variables and con...

Hi, You don't have to remove all constraints each time you compute new values for your dynamic variables in the model, see here. You can just remove the ones that actually change completely or are ...

Hi Linzhi, Generally Gurobi tries to utilize all Threads during an optimization run. If you want to parallelize your process on one machine, it could happen that the processes intercept each other....