Skip to main content

Non-convex QCPQ capability compared to SCIP



1 comment

  • Jaromił Najman
    Gurobi Staff Gurobi Staff

    While SCIP and Gurobi use the same idea to solve (continuous) non-convex QCQPs, the algorithm aren't exactly equal. Both, SCIP and Gurobi (and many other global (MI)NLP solvers)  use the spatial B&B algorithm but they all differ in certain aspects. Different solvers use different cuts, bound tightening techniques, branching rules, and node selection rules which already account for most of the performance differences between solvers. Moreover, similar to MIPs, there are many tricks which can be applied to certain (MI)NLP problems. This means that having a bigger bag of tricks can help you solve more models (faster).

    Best regards, 


Please sign in to leave a comment.