Hexaly Optimizer

Hexaly is a global optimization solver combining multiple modeling paradigms and solution techniques. Its nonlinear and set-oriented modeling formalism hybridizes and extends concepts from mixed-integer linear programming, nonlinear programming, constraint programming, and black-box optimization.

Its extensive collection of mathematical operators makes it straightforward to express academic and industrial problems. Furthermore, Hexaly’s set-oriented models for discrete optimization are compact, making it faster and more scalable than traditional solvers.

Hexaly combines the best exact and heuristic methods from the research, including spatial branch-and-bound, derivative-free, augmented Lagrangian, simplex, interior-point methods, constraint propagation, automatic branch-cut-and-price, decision diagrams, column elimination, and local and large neighborhood search.

Hexaly intelligently selects and coordinates these algorithmic strategies based on your problem’s structure, delivering the fastest solutions and tightest bounds at scale, especially for complex, real-world optimization challenges.