Communications of the
Korean Mathematical Society CKMS

We consider multiobjective fractional programming problems with generalized invexity. An equivalent multiobjective programming problem is formulated by using a modification of the objective function due to Antczak. We give relations between a multiobjective fractional programming problem and an equivalent multiobjective fractional problem which has a modifed objective function. And we present modified vector saddle point theorems.

Keywords: efficient solutions, weakly efficient solutions, invex functions, optimality conditions, vector saddle points

MSC numbers: 90C29, 90C32, 90C46