Approximate optimization of convex set functions. (English) Zbl 1194.90077
Summary: We introduce the notion of the \(\varepsilon\)-subdifferential for convex set functions and discuss some of its properties. These properties are then utilized to derive \(\varepsilon\)-Pareto optimality conditions of KKT type for nondifferentiable multiobjective optimization problems with convex set functions.
MSC:
90C29 | Multi-objective and goal programming |
49K27 | Optimality conditions for problems in abstract spaces |