The Black-Box Optimization Solver
Functional Summary
Table 1 outlines the options available in the SOLVE WITH BLACKBOX statement.
Table 1: Options for the Black-Box Solver
| Description | Option |
|---|---|
| Input Data Option | |
| Specifies the input cache set | CACHEIN= |
| Specifies the initial genetic algorithm population | FIRSTGEN= |
| Specifies whether to use the initial trial points | PRIMALIN |
| Output Data Options | |
| Specifies the output cache set | CACHEOUT= |
| Specifies the members of the genetic algorithm population on exit | LASTGEN= |
| Stopping Condition Options | |
| Specifies the absolute function convergence criterion | ABSFCONV= |
| Specifies the number of iterations without improvement for convergence | NABSFCONV= |
| Specifies the maximum number of function evaluations | MAXFUNC= |
| Specifies the maximum number of genetic algorithm iterations | MAXGEN= |
| Specifies the upper limit on real time | MAXTIME= |
| Optimization Control Options | |
| Specifies the feasibility tolerance | FEASTOL= |
| Specifies the number of global searches | NGLOBAL= |
| Specifies the number of local searches | NLOCAL= |
| Specifies the genetic algorithm population size | POPSIZE= |
| Technical Options | |
| Specifies the cache tolerance | CACHETOL= |
| Specifies the maximum cache size | CACHEMAX= |
| Specifies the maximum size of the Pareto-optimal set | PARETOMAX= |
| Specifies how frequently to print the solution progress | LOGFREQ= |
| Specifies how much detail of solution progress to print in the log | LOGLEVEL= |
| Initializes the seed for sampling routines | SEED= |
| Specifies the number of threads for the black-box solver to use | NTHREADS= |
Last updated: June 22, 2026