Multiobjective duality for convex semidefinite programming problems

We treat some duality assertions regarding multiobjective convex semi-definite programming problems. Having a vector minimization problem with convex entries in the objective vector function, we establish a dual for it using the so-called conjugacy approach. In order to deal with the duality assertions between these problems we need to study the duality properties and the optimality conditions of the scalarized problem associated to the initial one. Using these results we present the weak, strong and converse duality assertions regarding the primal problem and the dual we obtained for it.