|
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 | |
| LocalSolver environment | |
| Value type for collection expressions (lists) | |
| LocalSolver exception | |
| Mathematical modeling expression | |
| Inconsistency core of the optimization model | |
| Mathematical optimization model | |
| Context for native functions | |
| Solving parameters | |
| Optimization phase | |
| Solution to the optimization model | |
| Statistics of the search | |
| Version and copyright info | |
| 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 | |
| LocalSolverBlackBox environment | |
| LocalSolverBlackBox exception | |
| Mathematical modeling expression | |
| Mathematical optimization model | |
| Context for native functions | |
| Solving parameters | |
| Solution to the optimization model |