Let $n,k$ be positive integers such that $n\geq k$ and $G$ be a tripartite graph with parts $A,B,C$ such that $|A|=|B|=|C|=n$. Denote the edge densities of $G[A,B]$, $G[A,C]$ and $G[B,C]$ by $α$, $β$ and $γ$, respectively. In this paper, we study edge density conditions for the existence of $k$ vertex-disjoint triangles in a tripartite graph. For $n\geq 5k+2$ we give an optimal condition in terms of densities $α,β,γ$ for the existence of $k$ vertex-disjoint triangles in $G$. We also give an optimal condition in terms of densities $α,β,γ$ for the existence of a triangle-factor in $G$.