Abstract: Duality framework on vector optimization problems in a locally convex topological vector space are established by using scalarization with a cone-strongly increasing function. The dualities for the scalar convex composed optimization problems and for general vector optimization problems are studied. A general approach for studying duality in vector optimization problems is presented.

Key words: duality, efficient solution, composed convex optimization, K-convex mapping