Table 4 The properties of the Integer programming test functions
From: A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems
Function | Dimension (d) | Bound | Optimal |
|---|---|---|---|
\(FI _1\) | 5 | [−100 100] | 0 |
\(FI _2\) | 5 | [−100 100] | 0 |
\(FI _3\) | 5 | [−100 100] | −737 |
\(FI _4\) | 2 | [−100 100] | 0 |
\(FI _5\) | 4 | [−100 100] | 0 |
\(FI _6\) | 2 | [−100 100] | −6 |
\(FI _7\) | 2 | [−100 100] | −3833.12 |