I'm trying to solve a linear MIP with Gurobi and I'm having issues with the root-node relaxation of the problem. The problem is linear and contains at the initial state (before the presolving) 519263 continuous and 9 integer variables. The log says that the objective of the root relaxation is 2,804188 while the first found Incumbent in the MIP calculation is 119,00452. This value of the Incumbent is much more plausible than the root relaxation objective value. The best objective bound is also moving very slowly. I don't undertand why the root relaxation did't found a better solution. The best objective bound would move maybe faster then. Can you please help me on this issue?
Thank you very much in advance for your help!
Please sign in to leave a comment.