How does Gurobi determine whether a MIQCQP problem is feasible or not

Answered

Comments

3 comments

  • Yuriy Zinchenko

    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 very efficient on your models :)

     

    Hope this helps,

    0
    Comment actions Permalink
  • Sixiong You

    Thanks for your fast reply! I have read the recommended website, and it is helpful. 

    And I have one more question, just for the mixed-binary quadratic constrained programming (maybe nonconvex), is it possible that GUROBI will take a long time to tell whether this model is feasible or not? 

    0
    Comment actions Permalink
  • Yuriy Zinchenko

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

    0
    Comment actions Permalink

Please sign in to leave a comment.

Powered by Zendesk