Table 1 The main characteristics of thirteen benchmark problems from CEC2006.

From: Surrogate-assisted global and distributed local collaborative optimization algorithm for expensive constrained optimization problems

Problem

Dimension

Type of objective (estimate feasibility ratio)

L(N)a

g01

13

Quadratic (0.0111%)

9(0)6

g02

20

nonlinear (99.9971%)

0(2)1

g04

5

quadratic (52.1230%)

0(6)2

g06

2

cubic (0.0066%)

0(2)2

g07

10

quadratic (0.0003%)

3(5)6

g08

2

nonlinear (0.8560%)

0(2)0

g09

7

polynomial (0.5121%)

0(4)2

g10

8

linear (0.0010%)

3(3)6

g12

3

quadratic (4.7713%)

0(1)0

g16

5

nonlinear (0.0204%)

4(34)4

g18

9

quadratic (0.0000%)

0(13)6

g19

15

nonlinear (33.4761%)

0(5)0

g24

2

linear (79.6556%)

0(2)2

  1. Note: a is the number of active constraints at \(\operatorname{x}\), and L and N are the numbers of linear inequality constraints and nonlinear inequality constraints, respectively.
Back to article page