Webinar Summary

In this webinar, Dr. Ed Klotz, Gurobi’s Senior Mathematical Optimization Specialist, will explore models with products of binary variables.

Numerous Integer Programming formulations exist involving products of binary variables. In some cases they arise naturally from the formulation, while in other cases they are created by model reformulations.

In this webinar, you will learn:

  • Which strategies can improve performance on MILPs, including solver parameter settings.
  • How to tighten existing formulations.
  • How to reformulate to improve performance.

Practitioners who don’t explicitly solve MILP models with products of binaries may still benefit from this presentation, as a significant number of conditions explicitly modeled as linear constraints actually have products of binaries in disguise, including soft knapsack constraints, overlap constraints and some logical conditions in satisfiability problems. Therefore understanding techniques that can help performance on models with products of binaries can improve performance on some MILPs as well.

Presented Materials

Download the presentations, 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