On the reciprocal vector optimization problems

A necessary and sufficient condition is established for an optimal solution of a primal vector optimization problem to be an optimal solution of its reciprocal. Such a condition is developed and analyzed in the Pareto case, the strong case, and the lexicographic case. We detail these results for ordinary (i.e., scalar) optimization problems.