Some Results on Mathematical Programming with Generalized Ratio Invexity
نویسندگان
چکیده
منابع مشابه
Semi-infinite Multiobjective Programming with Generalized Invexity
Motivated by important applications, the theory of mathematical programming has been extended to the case of infinitely many restrictions. At the same time, this theory knew remarcable developments since invexity and its further generalizations have been introduced as substitute of convexity. Here, we consider the multiobjective programming with a set of restrictions indexed in a compact. We ob...
متن کاملNonsmooth Multiobjective Fractional Programming with Generalized Invexity
In this paper, we consider nonsmooth multiobjective fractional programming problems involving locally Lipschitz functions. We introduce the property of generalized invexity for fractional function. We present necessary optimality conditions, sufficient optimality conditions and duality relations for nonsmooth multiobjective fractional programming problems, which is for a weakly efficient soluti...
متن کاملGeneralized Convexity and Invexity in Optimization Theory: Some New Results
Convex like properties, without vector space structure are intensively used in the minimax theory Since Ky Fan has proved the first minimax theorem for concave-convexlike functions, several authors have proposed other extensions or generalizations for the convexity. In this paper we propose a survey of the recent studies concerning convexity and invexity in optimization theory. In fact, in the ...
متن کاملNondifferentiable multiobjective programming under generalized dI-invexity
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with inequality constraints. We introduce four new classes of generalized convex functions by combining the concepts of weak strictly pseudoinvex, strong pseudoinvex, weak quasi invex, weak pseudoinvex and strong quasi invex functions in Aghezzaf and Hachimi [Numer. Funct. Anal. Optim. 22 (2001) 775], d-...
متن کاملGeneralized Minimax Programming with Nondifferentiable (G, β)-Invexity
We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz (G, β)-invex. Not only G-sufficient but also G-necessary optimality conditions are established for problem (P). With G-necessary optimality conditions and (G, β)-invexity on hand, we construct dual problem (DI) for the primal one (P) and prove duality results between problems (P) and (DI). These...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1999
ISSN: 0022-247X
DOI: 10.1006/jmaa.1999.6334