# The best MINLP solver in the world.

## What you can solve

##### Octeract Engine can solve any problem of the following type to local or global optimality:
$\min_{x\in X\\y\in Y}f(x,y)\\ \text{s.t.}\\ g(x,y)\leq 0\\h(x,y)=0$

where $$x\in\mathbb{R},y\in\mathbb{Z}$$. The functions do not need to be continuous nor differentiable.

To make this simple for you, here’s a handy bestiary for thee noobs:

 Class Convex Nonconvex Discrete Pure binary Discontinuous/non-smooth functional forms Subclasses Linear N/A N/A Yes Yes N/A LP, BLP, MBLP, ILP, MILP Quadratic Yes Yes Yes Yes N/A QP, QCP, QCQP, BQP, BQCP, BQCQP, MBQP, MBQCP, MBQCQP, IQP, IQCP, IQCQP, MIQP, MIQCP, MIQCQP General nonlinear Yes Yes Yes Yes Yes NLP, BNLP, MBNLP, INLP, MINLP, DNLP, DBNLP, DMBNLP, DINLP, DMINLP

If you have any knowledge of the field whatsoever, you know that this is basically any problem up to and including DMINLP.

Factoring in the convex/nonconvex combinations, this gives us a whooping 55 distinct problem types that you can solve with Octeract Engine*.

The engine will automatically classify your problem, and use specialised algorithms for that problem class.

*No engineers were seriously harmed in the making of this engine

## Why it's the best

First of all because we say so, and tbh we know what we’re talking about.

If you think you can understand data, here’s some for you you heathen.

## It Slays in the benchmarks

And we’re not talking vs open-source relics, we’re destroying solvers people use in production right now. We lap all the other MINLP solvers in most test sets, sometimes more than twice. Sucks to suck.

## Doesn't Suffer From Solver Paranoia

This is the clinical condition where people get so paranoid about someone beating their precious solvers that they don’t tell the user what on earth the solver is doing. Why? Because they want to keep it secret. Keep it safe.

Good ones too. We used systems design to code the solver, and since it is actively trying to inform you about everything, you can actually use your brain to manipulate the state machine using 90+ options.

## Best Data Throughput In The World

A.K.A. it gets the least stuck. If you’ve ever tried to load a big-ass problem into a solver that needs to parse symbolic structures you know that preprocessing can get so hilariously stuck it never finishes at all. Well, ours is so fast that we do it at least twice. GG2EZ.

## Built for PvP

We talk the talk and we walk the walk. If any n00bz try to convince you they have better gear, we’ll crush them like a walnut – just send us the problem you need solved and get ready to buy the solver. We ain’t giving away free loot.

## GG gear

Octeract Engine is the first and only MINLP solver in the world that is built for distributed branch-and-bound. Those benchmarks^^ btw are on 1 and 8 cores. Here’s a glimpse of the carnage on HPC =>

## 4.5.1

#### Windows 64-bit

Windows 10 and above

#### Linux 64-bit

CentOS 7/Ubuntu 18 and above

## (excl. VAT)

Vendors
from $4,000 annually • Octeract Engine for AIMMS, AMPL, or GAMS • Support by vendors • Starts at 16 cores ### Academic licences Vendors From$800 annually
• Octeract Engine for AIMMS, AMPL, or GAMS
• Support by vendors
• Starts at 16 cores
Legendary

### Flexible/custom Licences

Octeract
contact sales sometime
• Group, HPC, any #of users and machines
• Support by Octeract
• Any number of cores/machines