AI 中文总结
研究储能功率调度中混合整数规划计算量大的问题，提出其松弛精确性的充要条件，推导松弛间隙，表明特定控制策略与MIP模型最优值关系，提出两阶段算法提高计算效率。
AI 中文摘要
混合整数规划（MIP）在储能系统（ESS）功率调度中排除了同时充放电情况，计算量较大。松弛这种互补约束可提高计算效率，但可能导致不切实际的控制策略。本文提出了这种松弛精确性的充要条件，明确推导了松弛间隙，揭示了某种控制策略不一定意味着与MIP模型有不同最优值，且可在不影响最优值的情况下恢复无该控制策略的可行解。还提出了两阶段松弛与恢复算法以提高ESS功率调度优化的计算效率。
英文摘要
Mixed-integer programming (MIP) precludes simultaneous charging and discharging in power dispatch of energy storage system (ESS), but is computationally intensive. Relaxation of this complementarity constraint improves computational efficiency, but may incur an impractical control SCD strategy. To bridge this gap, this letter proposes a necessary and sufficient condition for the exactness of such relaxation. We explicitly derive the relaxation gap and reveal that SCD does not necessarily imply a distinguished optimal value from the MIP model. In such cases, a feasible solution without SCD can be readily recovered without compromising the optimal value. Furthermore, a two-stage relaxation-and-recovery algorithm is proposed to improve the computational efficiency of ESS power dispatch optimization.
