SAT Strategic Advisors for Transformation AG, based in Freiburg, Germany, is pleased to announce their adoption of the Gurobi Optimizer for use in building optimization solutions for their customers.

“Beyond our own experience with Gurobi’s advanced algorithms and full-range of APIs, many published benchmarks and studies show Gurobi is the most technically advanced Mathematical Programming solver available,” said Dr. Thomas Arzt, CEO of SAT AG. “Gurobi’s focus on continual improvement is important since we focus on delivering the best performing optimization solutions possible, now and over time, for our clients.”

“Of course, performance wasn’t the only reason we chose Gurobi. Keeping projects on-time and on-budget is something we pride ourselves on. As a result, good documentation and direct access to support staffed by Gurobi optimization experts played as big a role in our decision.”

This relationship further expands the number of ISVs world-wide adopting the Gurobi Optimizer to help them meet the needs of their clients. “ISVs such as SAT AG are a critical part of our business,” said Dr. Robert Bixby, CEO and co-founder of Gurobi Optimization, Inc. “That is why our ISV program offers flexible licensing and great support tailored to the needs of companies like SAT AG. In addition, we make a point of not building applications that compete with those of our ISVs; we’re a partner, not a competitor, and are very pleased that SAT AG has chosen to switch to the Gurobi Optimizer.”


About SAT AG

SAT Strategic Advisors for Transformation AG (, headquartered in Freiburg, Germany, is a worldwide operating simulation and optimization consulting company dedicated to “Simulation-based Complexity Management” and the systematic application of Discrete Event Simulation, System Dynamics, Agent-Based Modeling, and leading edge Optimization Techniques. SAT Strategic Advisors for Transformation AG, being recognized as the leading simulation company in Germany, was founded by Dr. Thomas Arzt, who has over 30 years of experience in simulation and optimization.

About Gurobi Optimization, Inc.

Gurobi ( is in the business of helping companies solve their hardest problems. In addition to providing the best optimization solver, the company is known for its outstanding support and no-surprises pricing. The Gurobi Optimizer is a state-of-the-art solver for linear programming (LP), quadratic programming (QP), quadratically constrained programming (QCP), mixed-integer linear programming (MILP), mixed-integer quadratic programming (MIQP), and mixed-integer quadratically constrained programming (MIQCP). Gurobi was designed from the ground up to exploit modern architectures and multi-core processors, using the most advanced implementations of the latest algorithms. Founded in 2008, Gurobi Optimization is based in Houston, TX (+1 713 871 9341).

Guidance for Your Journey

Gurobi: Always Free for Academics

We make it easy for students, faculty, and researchers to work with mathematical optimization.

Trusted Partners, at Your Service

When you face complex optimization challenges, you can trust our Gurobi Alliance partners for expert services.

We’ve Got Your Back

Our global team of helpful, PhD-level experts are here to support you—with responses in hours, not days.

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