Yuriy Zinchenko

It is certainly possible that the solver takes a while -- non-convex MIQP can be very challenging.

Generally speaking, Gurobi will apply same "branch and cut" approach as for the MIP, e.g., see here for very basic explanation, https://www.gurobi.com/resource/mip-basics/ It sounds we are just ver...

With a single thread the runs should be deterministic, but you can also try setting Method to value 4 or 5 to make sure, https://www.gurobi.com/documentation/9.0/refman/method.html (we cannot guara...

Hello Daniel, I do not think that in general one can exploit this information --the uniqueness of continuous portion of the solution as a function of discrete variables' values-- to speed up the so...

> Do you mean that Gurobi identifies that should stop after finding a single solution and changes the search strategy on its own? Yes, Gurobi will take into account the solution limit settings. If ...

To approximate the Pareto frontier you may want to get more sample points in that set.  Having said that, both the weighted and the hierarchical approach will give you points on the frontier.   Hop...

Hello Sagnik, I am not quite sure I understand your question, can you possibly paraphrase? Hierarchical method is very similar to what you have described as \epsilon method, expect for the constrai...

Have you had a chance to save an LP file and examine the model "by hand", to make sure your indices are correct etc.? You can save the model using > model.write("myModel.lp")   Let me know what you...

The solver may remove some variables and do other things as part of the presolve, so if you are curious to see if this plays any role here you can try setting Presolve = 0 to switch it off (mind yo...

Can you add your own cut in the callback, using the newly-determined value for the objective cut-off?