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

回答済み

Sixiong You

2020年03月05日 21:04

• 
• 
• 

Hi, I am working on the mixed-integer 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

0

• 正式なコメント

  

  Simranjit Kaur

  • Gurobi Staff

  2025年06月23日 03:16 編集済み

  This post is more than three years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum. Or why not try our AI Gurobot?.
• 

  Yuriy Zinchenko

  • Gurobi Staff

  2020年03月06日 00:44

  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
• 

  Sixiong You

  2020年03月06日 21:19

  • 
  • 
  • 

  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
• 

  Yuriy Zinchenko

  • Gurobi Staff

  2020年03月09日 16:00

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

  0

投稿コメントは受け付けていません。