Lexicographical order and duality in multiobjective programming (Q1104248)

Developed is a duality theory in multiple objective convex programming theory by using a lexicographical approach. The motivation of this is in extending some known results to problems which do not meet some regularity assumptions. The usual scalarization had to be replaced by nonnegative linear combinations with vector coefficients of the objectives, which permits to obtain all the Pareto minima. It should be noted that the methods employed in this paper could perhaps be applied in connection with other duality theories in multiobjective programming.