Vector valued Lagrangian and invexity type multiobjective programming problems

This paper discusses optimality criteria for a newly defined class of multiobjective problems in which the functions are assumed to be SFJ-invex. Optimality criteria are related to certain vector saddle points of a vector-valued Lagrangian. At the end SFJ-invex programming is generalized and is applied to (h,ø)-convex programming. Further it is shown that results proved in this paper can be applied to a multiobjective fractional programming as a special case.