The paper aims to emphasise the parallelism between the development of the analysis of Generalized Convexity and the theory of Variational Inequalities. More in detail, the relationships between generalized invexity and Prevariational Inequalities are analised.

In this paper, we start our discussion with a pair of multiobjective MondWeir type second-order symmetric dual fractional programming problem and derive weak, strong and strict duality theorems under second-order (φ, ρ)-invexity assumptions.

Mond-Weir type duals for multiobjective variational problems are formulated. Under generalized vector variational type I invexity assumptions on the functions involved, sufficient optimality conditions, weak and strong duality theorems are proved efficient and properly efficient solutions of the primal and dual problems.

The concepts of ( , ρ)-invexity have been given by Carsiti,Ferrara and Stefanescu[32]. We consider a second-order dual model associated to a multiobjective programming problem involving support functions and a weak duality result is established under appropriate second-order ( , ρ)-univexity conditions. AMS 2002 Subject Classification: 90C29, 90C30, 90C46.

In this paper, we consider different kinds of generalized invexity for vector valued functions and a vector optimization problem. Some relations between some vector variational-like inequalities and a vector optimization problem are established using the properties of Mordukhovich limiting subdifferentials under C − η−strong pseudomonotonicity. Mathematics Subject Classification (2010): 26A51, ...

First a new notion of the random exponential Hanson-Antczak type [Formula: see text]-V-invexity is introduced, which generalizes most of the existing notions in the literature, second a random function [Formula: see text] of the second order is defined, and finally a class of asymptotically sufficient efficiency conditions in semi-infinite multi-objective fractional programming is established. ...

Abstract In this paper, a class of E -differentiable vector optimization problems with both inequality and equality constraints is considered. The so-called mixed -dual problem defined for the considered constraints. Then, several -duality theorems are established under (generalized) V - -invexity hypotheses.

Numerous applications of the theory convex and nonconvex mapping exist in fields applied mathematics engineering. In this paper, we have defined a new class functions which is known as up down pre-invex (pre-incave) fuzzy number valued mappings (F-N-V?Ms). The well-known Hermite–Hadamard (????????)-type related inequalities are taken into account work. We extend mileage further using Riemann in...