# The Engine: Where’s the Value?

This post aims to showcase the value of Octeract Engine.

In this breakdown, you’ll find:

<a target="_self" aria-label="<strong>The Features
The Features
<a target="_self" aria-label="<strong>The Numbers
The Numbers
<a target="_self" aria-label="<strong>The Open Door
The Open Door

Let’s uncover the powers of this technology.

## The Features

Octeract Engine has superpowers: it solves any complex problem without breaking a sweat.

The best way to illustrate the Engine’s unique qualities is to list some of its features and how they are valuable.

Guarantees Global Optimality

The Engine solves to the global optimum. This is without user intervention or running the problem for hours on end.

Why is this valuable?
This saves the user time. A guaranteed optimal solution for an “unsolvable” problem allows the user to make efficient decisions.

Built-in Reformulations

The built-in symbolic reformulation engine has over 175 reformulations. This is one of the highest number of reformulations known in a solver.

Why is this valuable?
Reformulations allow for the automatic simplification of any optimisation problem. This removes room for error.

Detects
Infeasibility

This technology can prove or disprove infeasibility of an optimisation problem. Consequently, the optimisation model can be changed if need be.

Why is this valuable?
This allows the user to make necessary changes to the structure of a problem which saves time and improves the accuracy of decisions made.

Solves Non-smooth Problems

Octeract Engine solves any non-convex, discontinuous problem.

Why is this valuable?
These problems are so difficult to solve that most solvers crash trying to return a solution. The Engine saves the user from having to do some master maths beforehand and consistently delivers on solving complex problems.

Solves General MINLPs

This technology has the ability to solve MINLPs as well as all its sub-sets.

Why is this valuable?
These problems have continuous and discrete variables. They are known for having nonlinear functions in the objective function and/or the constraints. Once again, this level of difficulty would be a bridge too far for most solvers whereas Octeract Engine cuts through the complexity. This saves users time and frustration.

Natively
Parallel

This built-in feature gives the Engine the power to use thousands of Central Processing Units (CPUs).

Why is this valuable?
This not only improves the speed of running an optimisation problem but it also increases the probability of finding a feasible solution.

In addition to this, the Engine has a user-friendly interface. This allows our technology to bridge the gap between having an optimisation problem and getting it solved. It is made FOR EVERYONE with ANY optimisation problem. Period.

## The Numbers

These are great stand-alone features however when combined, they give Octeract Engine ultimate power. Power to solve not only complex non-linear optimisation problems but linear problems too.

You might be looking for some hard evidence to support this power. Great, don’t take our word for it. We have got some numbers to support the Engine’s worth. That’s where the real value is after all.

28

67

100

### % Increase in Solving Time

Whether the objective function of the optimisation problem involves profitability, cost or time, the Engine has the ability to improve efficiency across the board. These numbers offer a glimpse into what this state-of-the-art technology is capable of. The Engine’s quality has been put to the test and benchmarked by a third party. This solver is making waves in the optimisation software space and it is readily available for everyone to use.

## The Open Door

Yes, you read that correctly: this advanced technology is at your fingertips. We offer free distributed computing that does everything for you. Each feature adds value – the proof is in the numbers. No problem is too complex. What are you waiting for? Register to start solving seamlessly. It’s free! We think it’s worth its weight, let us know your thoughts.