Generalized V-univexity type-I for multiobjective programming with \(n\)-set functions (Q2271161)

The authors, motivated by applications, discuss the concept of optimizing set or \(n\)-set functions. This situation occurs when dealing with optimal selection of measurable subsets for instance. Thus, this paper considers some clasess of univexity type I functions and states sufficient and necessary optimality conditions for a multiobjective optimization problems involving set functions. Then, some duality results for generalized Mond-Weir dual problem are established, as well as weak, strong and converse duality theorems are proved. Finally, it is given a procedure, through which we may transform examples of \(V\)-univexity type optimization problems on \(\mathbb{R}^n\) into \(V\)-univexity type optimziation problems that involve set or \(n\)-set functions.