“…The classical Benders decomposition algorithm cannot solve the problem () directly, as the exact dual of the MILP problem
cannot be derived. Considering the first‐stage decision variable vector
is a binary vector, the nested Benders decomposition algorithm can be used to derive the expansion plan in finite iterations [
38, 39]. However, the original and relaxed
should be solved in sequential to obtain the exact value function and optimal/feasible cuts for a given combination of
and
, which is computationally expensive.…”