We consider discrete time Markov chains with Polish state space. The large deviations principle for empirical measures of a Markov chain can equivalently be stated in Laplace principle form, which builds on the convex dual pair of relative entropy (or Kullback-Leibler divergence) and cumulant generating functional $f\mapsto \ln \int \exp(f)$. Following the approach by Lacker in the i.i.d. case, we generalize the Laplace principle to a greater class of convex dual pairs. We present in depth one application arising from this extension, which includes large deviations results and a weak law of large numbers for certain robust Markov chains - similar to Markov set chains - where we model robustness via the first Wasserstein distance. The setting and proof of the extended Laplace principle are based on the weak convergence approach to large deviations by Dupuis and Ellis.