One major new feature in Gurobi 9.0 is a new bilinear solver, which allows users to solve problems with non-convex quadratic objectives and constraints (i.e., QPs, QCPs, MIQPs, and MIQCPs). Many non-linear optimization solvers search for locally optimal solutions to these problems.
In contrast, Gurobi can now solve these problems to global optimality. Non-convex quadratic optimization problems arise in various industrial applications. In particular, non-convex quadratic constraints are vital to solve classical pooling and blending problems.
In this webinar session, we will:
Choose the evaluation license that fits you best, and start working with our Expert Team for technical guidance and support.
Request free trial hours, so you can see how quickly and easily a model can be solved on the cloud.