Localsolver
6.0
|
![]() ![]() | The classical version of LocalSolver is designed to solve large scale optimization problem in boolean, integer and continuous decisions. The model is described as a set of mathematical expressions that can be constrained or optimized |
![]() ![]() | LocalSolverBlackBox solves blackbox optimization problem where the objective function is unknown and costly to evaluate. The function can have boolean, integer or continuous decisions in a finite range |