Do we know why open source MIP solvers are significantly slower than commercial ones?

[SanPen]

I develop power system software, and part of that involves solving large MIPs.

While testing different solvers, I noticed that the open source ones (Highs, CBC, Scip) perform about the same, while the commercial ones (CPLEX, XPRESS, and Gurobi) perform about the same among them, but are about two orders of magnitude faster than the open source ones for the same MIP, sometimes yielding different solutions that also solve the problem.

This seems to be due to an algorithmic advantage rather than to programming techniques.

¿Do we know what commercial solvers are doing to be much faster?

I've noticed that for LP problems of the kind that I solve, all solvers perform comparably.

[jajhall]

Commercial MIP solvers benefit from person-decades of development investment - funded by high license fees. They have parallel tree search, and all sorts of tricks to handle different classes of problem. You may have seen "two orders of magnitude" difference in performance on your instances, but it's about one order of magnitude for Mittlemann's benchmarks between HiGHS and Gurobi - and not much more for SCIP and Cbc. HiGHS is looking to parallelise its tree search in 2024.

Again YMMV, but for LP on Mittlemann's benchmarks the best open-source solver - HiGHS - is 20 times slower than the best commercial solver (COPT). That's down to the idiosyncratic IPM implementation in HiGHS - which is why it's better than other open-source LP solvers - and parallelism. HiGHS is writing a new solver with the aim of reducing the gap.