How does Gurobi determine whether a MIQCQP problem is feasible or not
AnsweredHi, I am working on the mixedinteger quadratically constrained quadratic programmings (MIQCQP), and I found that when I randomly generated some nonconvex MIQCQP problems, the Gurobi can tell me quickly if this problem is infeasible or not, I am wondering why Gurobi can be so efficient to judge whether a problem is feasible or not, or is it possible gives me some wrong information?
Thanks

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/mipbasics/
It sounds we are just very efficient on your models :)
Hope this helps,

Thanks for your fast reply! I have read the recommended website, and it is helpful.
And I have one more question, just for the mixedbinary quadratic constrained programming (maybe nonconvex), is it possible that GUROBI will take a long time to tell whether this model is feasible or not?
Please sign in to leave a comment.
Comments
3 comments