“…The conventional mathematical optimization includes (1) linear programming [23][24][25][51][52][53]102,103]; (2) quadratic programming [9,20,26,40,52,104]; (3) stochastic/deterministic dynamic programming [20,28,55,105] and relaxed dynamic programming [27,29]; (4) Lagrange relaxation [55]; (5) binary linear programming [53]; (6) mixed integer linear programming [38,52,55,57,89,106]; (7) mixed-integer nonlinear programming [107]; (8) stochastic programming [20,57]; (9) mixed-integer linear stochastic programming [57]; (10) maximum sensitivities selection optimization approach [39,44]; (11) game theory [35,108,109]; and (12) queuing theory [88,110].…”