In this paper, a generalization of convexity, namely Gf-invexity is considered. We formulate Mond-Weir type symmetric dual for class nondifferentiable multiobjective fractional programming problem over cones. Next, we prove appropriate duality results using assumptions.

In this paper, several kinds of invariant monotone maps and generalized invariant monotone maps are introduced. Some examples are given which show that invariant monotonicity and generalized invariant monotonicity are proper generalizations of monotonicity and generalized monotonicity. Relationships between generalized invariant monotonicity and generalized invexity are established. Our results...

The purpose of this paper is to derive some criteria for vectorial prequasi-invex type functions via Jensen type inequalities. It is shown that a Jensen type inequality is sufficient and necessary for a vector function to be prequasi-invex under the condition of lower levelclosedness, cone lower semicontinuity, cone upper semicontinuity and semistrict prequasi-invexity, respectively. Analogous ...

Abstract: In this paper, we generalize the (V, ρ)-invexity defined for nonsmooth multiobjective fractional programming by Mishra, Rueda and Giorgi (2003) to variational programming problems by defining new classes of vector-valued functions called (V, ρ)B-type I and generalized (V, ρ)-B-type I. Then we use these new classes to derive various sufficient optimality conditions and mixed type duali...

Convexity assumptions for fractional programming of variational type are relaxed to generalized invexity. The sufficient optimality conditions are employed to construct a mixed dual programming problem. It will involve the Wolfe type dual and Mond-Weir type dual as its special situations. Several duality theorems concerning weak, strong, and strict converse duality under the framework in mixed ...