Highs

Main HiGHS solver class - high-performance LP/MIP/QP optimization

Main HiGHS solver class - high-performance LP/MIP/QP optimization

HiGHS (High-performance Interior point and Gradient descent Solvers) is an open-source solver for LP, MIP, and convex QP problems.

Highs Class (Main API): Primary interface for model input, solving, and solution retrieval:

Solving Capabilities:

Model Modification:

Basis Operations:

Options and Info:

Algorithm

MIP Solving:

  • Presolve: probing, clique detection, coefficient strengthening
  • Cuts: Gomory, MIR, clique, zero-half, knapsack cover
  • Branching: reliability branching with pseudocost initialization
  • Heuristics: RINS, local search, rounding, feasibility pump

Complexity: LP: $O(m·n·iterations)$ simplex, $O(n³)$ per IPM iteration MIP: exponential worst-case, highly structure-dependent

References:

  • Huangfu, Q. and Hall, J.A.J. (2018). "Parallelizing the dual revised simplex method". Math. Prog. Computation 10:119-142.

See Also

Source

Header file: `highs/Highs.h`