“…Some of the classical techniques that have been applied to GEP problems include LP, 40,125,126 DP, 19,30,37,101,113,123,[127][128][129][130] system dynamic method (SDM), 131,132 hierarchical decomposition (HD), 24,40,133 game theory (GT), 16,120,[134][135][136] NLP, 38,137 branch and bound (BB), 110,138-140 mixed-integer linear programming (MILP), 43,58,83,105,141 Dantzig-Wolfe decomposition (DWD), 22,142 quadratic programming (QP), 143,144 cross entropy (CE), 9 and the Benders decomposition method (BD). 7,26,63,65,101,103,[145][146][147] Although easy to use, the classical techniques present a challenge in real-world applications because practical problems consist of noncontinuous and/or differentiable objective functions. 36…”