Summary: The concept of rainbow connection was introduced by \textit{G. Chartrand} et al. [Math. Bohem. 133, No. 1, 85--98 (2008; Zbl 1199.05106)]. The rainbow connection number, \(\operatorname{rc}(G)\), of a connected graph \(G=(V,E)\) is the minimum number of colors needed to color the edges of \(E\), so that each pair of the vertices in \(V\) is connected by at least one path in which no two edges are assigned the same color. The rainbow vertex-connection number, \(\operatorname{rvc}(G)\), is the vertex version of this problem. In this paper, we introduce mixed integer programming models for both versions of the problem. We show the validity of the proposed models and test their efficiency using a nonlinear programming solver.