We determine upper and lower bounds on the zero forcing number of 2-connected outerplanar graphs in terms of the structure of the weak dual. We show that the upper bound is always at most half the number of vertices of the graph. This work generalizes work of Hernández, Ranilla and Ranilla-Cortina who proved a similar result for maximal outerplanar graphs.