Problem	Variables	Constraints	Description
Ackley	-	0	Characterized by a nearly flat outer region, and a large hole at the centre. The function poses a risk for optimization algorithms, particularly hillclimbing algorithms, to be trapped in one of its many local minima.
Griewank	-	0	Has many widespread local minima, which are regularly distributed. The complexity is shown in the zoomed-in plots.
Rastrigin	-	0	A non-convex, non-linear multimodal functionused as a performance test problem for optimization algorithms. Finding the minimum of this function is a fairly difficult problem due to its large search space and its large number of local minima.
Rosenbrock	-	0
Schwefel	-	0
Sphere	-	0
Zakharov	-	0
Knapsack	-	1
G1	13	9
G2	20	2
G3	10	1
G4	5	6
G5	4	5
G6	2	2
G7	10	8
G8	2	2
G9	7	4
G10	8	6