Existence and optimality of strong stability preserving linear multistep methods: a duality-based approach

We prove the existence of explicit linear multistep methods of any order with positive coefficients. Our approach is based on formulating a linear programming problem and establishing infeasibility of the dual problem. This yields a number of other theoretical advances.