The linear programs are solved consecutively one after another by the simplex algorithm. The algorithm can be warm-started, i.e. we can provide an initial guess for the solution, to prevent the algorithm from randomly starting the search in some point located far away from the optimal one. Here we propose the values from the previous moment t -1 as the initial guess: having solved the problem (1) for t -1, we pass the resulting values as a warm-start for problem (1) at t. This modification of the algorithm is implemented in the magnetstein Python package.