Mond-Weir duality: Unitary character and a converse duality theorem for vector programs (Q2778517)

The author describes several types of duality for a vector programming problem by following the pattern of Mond-Weir's duality, and shows that all of these types can be derived from the one given by \textit{T. Weir} [J. Aust. Math. Soc., Ser. A, 43, 21-34 (1987; Zbl 0616.90077)]. Then he proves a converse duality theorem for Weir's dual problem. Except for this latter theorem, the paper is identical with the author's previous work published in ibid. 3, No. 2, 37--42 (2001; Zbl 1052.90077).