Is the mixed integer quadratic programming converted to a cone programming in the solving process?
Answered
0
-
How does the solver calculate mixed-integer quadratic programming?
0 -
For MIQCPs, there are two cases to distinguish. The quadratic part of the model can be identified as convex or non-convex.
Luckily we have webinars explaining both cases.
For the convex case, please refer to the webinar The New Gurobi Quadratic Constraint (QCP and SOCP) Optimizer.
For the non-convex case, please refer to the webinar Products of Variables in Mixed Integer Programming.
Best regards,
Jaromił0
Please sign in to leave a comment.
Comments
2 comments