1 présentation

• 
  16h45 - 17h07

  Hexaly, a new kind of global optimization solver

  • Fred Gardi, prés., Hexaly

  Hexaly is a new kind of global optimization solver. Hexaly APIs unify modeling concepts from mixed-linear programming, nonlinear programming, and constraint programming. Its modeling interface is nonlinear and set-oriented. It also supports user-coded functions, thus enabling black-box optimization and, more particularly, simulation optimization. Under the hood, Hexaly combines various exact and heuristic optimization methods: spatial branch-and-bound, simplex methods, interior-point methods, automatic Dantzig-Wolfe reformulation, column and row generation, propagation methods, local search, population-based methods, and surrogate modeling techniques for black-box optimization. We illustrate these new modeling concepts on the seminal Traveling Salesman Problem (TSP), thus offering natural and compact modeling of the problem and performance on par with Concorde, the renowned TSP solver.