The main benefit with ojAlgo's suite of mathematical optimisation solvers is that it's open source pure Java. It allows to solve mathematical optimisation problems directly in the JVM – no…

Continue ReadingOptimisation-as-a-Service

ojAlgo v52.0.0 has been released! It is the first release to require Java 11. org.ojalgo.array The array package now support "arrays" of any primitive numeric type. In particular support for…

Continue ReadingojAlgo v52

If you need to solve mathematical optimisation LP, QP or MIP models without calling native code – running only pure Java code – there are very few options. In fact,…

Continue ReadingLP, QP & MIP on the JVM

A comparison between some iterative methods to solve linear equation systems. We'll compare 3 different methods: Jacobi, Gauss-Seidel and the Conjugate Gradient method. First the Jacobi and Gauss-Seidel methods are…

Continue ReadingIterative Solver Comparison

Imagine there's a sequence of operations you need to perform on a dataset, and this dataset is very large. There is absolutely no way the entire dataset could fit in…

Continue ReadingIntroducing BatchNode

With ojAlgo v51.2.0 the IntegerSolver gained support for Gomory Mixed Integer (GMI) cuts. Details of what they are and how they're derived is described in many publications. Just google it.…

Continue ReadingGomory Mixed Integer Cuts

With v51.1.0 the IntegerSolver got redesigned in terms of how it multi-threads as well as how it can be configured. With most, if not all, tests the new design performs…

Continue ReadingMIP Strategy Configuration