Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity (Q1038374): Difference between revisions

The point of this paper is, that a generalized invexity for vector functions is introduced, where each component of such a vector function is directionally differentiable in its own direction instead of a same direction \(d\). Using this kind of invexity the authors get new classes of multiobjective programming problems slightly different from such vector problems in this area. They prove corresponding necessary and sufficient optimality conditions and -- for Mond-Weir type duality -- duality results.