Webinar Summary

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:

  • Introduce MIQCPs and mixed-integer bilinear programming
  • Discuss algorithmic ideas for handling bilinear constraints
  • Show a live demo of how Gurobi 9.0 supports bilinear constraints by building and solving a small instance of the pooling problem

Presented Materials

You can download the PDF with the slides here and the pooling problem Jupyter Notebook here.

Meet the Experts

New at Gurobi

Gurobi 10.0 Delivers Blazing-Fast Speed, Innovative Data Science Integration, and an Enterprise Development and Deployment Experience
Latest release enables data professionals to easily integrate machine learning models into optimization models to solve new types of problems.
 Learn More
Webinar: What’s New in Gurobi 10.0
In this webinar, attendees will get a first look at our upcoming product release, Gurobi 10.0. We will summarize the performance improvements and highlight some of the underlying algorithmic advances, such as the network simplex algorithm, enhancements in concurrent LP, and optimization based bound tightening.
 Learn More
new content
Cost Savings & Business Benefits for Gurobi Customers
2022 Total Economic Impact™ Study Reveals A 518% ROI with Gurobi
 Learn More