Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints

Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann

Abstract: 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.