In the article Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints , we claimed a worst-case runtime of and for the Multi-Objective Evolutionary Algorithm and the Multi-Objective Genetic Algorithm, respectively, on linear profit functions under dynamic uniform constraint, where denotes the difference between the original constraint bound B and the new one. The technique used to prove these results contained an error. We correct this mistake and show a weaker bound of for both algorithms instead.

中文翻译：

---

更正：动态均匀约束下线性函数进化算法的重新优化时间分析

在动态统一约束下线性函数进化算法的重新优化时间分析一文中，我们分别声明了多目标进化算法和多目标遗传算法在动态统一约束下的线性利润函数的最坏情况运行时间约束，其中表示原始约束边界 B 和新约束之间的差异。用于证明这些结果的技术存在错误。我们纠正了这个错误，并显示了两种算法的较弱边界。