We present a few techniques to find completely positive maps between full matrix algebras taking prescribed values on given data, based on semidefinite programming, convex minimization supported by a numerical example, as well as representations by linear functionals. The particular case of commutative data is also discussed.