Webinar Summary

Products of problem variables appear naturally in quadratic programs. Special preprocessing, linearization, and cutting plane techniques are available to deal with such products. If at least one of the two variables in a product is binary, then the product can be modeled using a set of linear constraints.

As a consequence, there are many mixed-integer linear programs (MILPs) that actually contain products of variables hidden in their constraint structure. Rediscovering these product relationships between the variables enables us to exploit the solving techniques for product terms.

In this webinar, we will:

  • Explain how such product relationships can be detected in a given mixed integer linear program
  • Demonstrate ideas on how they can be exploited to improve the performance of an MILP solver
  • Describe cuts from the Reformulation Linearization Technique (RLT) and cuts for the Boolean Quadric Polytope (BQP)
  • Present preliminary computational results from these techniques in Gurobi version 9.0

 

Presented Materials

You can download the materials associated with this webinar here.

Meet the Experts

What's
New at Gurobi

News
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
Event
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