A New Duality Approach to Solving Concave Vector Maximization Problems

We introduce a special class of monotonic functions with the help of support functions and polar sets, and use it to construct a scalarized problem and its dual for a vector optimization problem. The dual construction allows us to develop a new method for generating weak efficient solutions of a concave vector maximization problem and establish its convergence. Some numerical examples are given to illustrate the applicability of the method.