Reoptimization Time Analysis Of Evolutionary Algorithms On Linear Functions Under Dynamic Uniform Constraints (Vol 81, Pg 828, 2019)

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.