A general approach for studying duality in multiobjective optimization

A general duality framework in convex multiobjective optimization is established using the scalarization with K-strongly increasing functions and the conjugate duality for composed convex cone-constrained optimization problems. Other scalarizations used in the literature arise as particular cases and the general duality is specialized for some of them, namely linear scalarization, maximum (-linear) scalarization, set scalarization, (semi)norm scalarization and quadratic scalarization. Copyright Springer-Verlag 2007