Conjugate duality for multiobjective composed optimization problems (Q2460678)

The paper is concerned with the construction and investigation of a dual problem for a multiobjective optimization problem in which the objective function and the constraint functions are composed convex functions. The analysis of the problem is based on the consideration of a scalar optimization problem associated with the multiobjective problem and on the study of the dual problem of this scalar problem. The latter was introduced by \textit{G. Wanka, R. I. Boţ,} and \textit{E. Vargyas} [Math. Methods Oper. Res. 66, 47--68 (2007; Zbl 1133.49031)]. By this and by optimality conditions for the primal and the dual scalar problem a multiobjective dual is stated, and a weak and a strong duality theorem are proved. The total framework is quite general so that it can be applied in particular to the classical multiobjective optimization problem with inequality and geometric constraints and to the multiobjective composed optimization problem with geometric constraints.