Higher-order generalized invexity and duality in nondifferentiable mathematical programming
نویسندگان
چکیده
منابع مشابه
Generalized Second-Order Mixed Symmetric Duality in Nondifferentiable Mathematical Programming
and Applied Analysis 3 It can be easily seen that for a compact convex set C, y is in NC x if and only if S y | C xy, or equivalently, x is in ∂S y | C . Definition 2.2. A functional F : X × X × R → R where X ⊆ R is sublinear with respect to the third variable if for all x, u ∈ X ×X, i F x, u; a1 a2 ≤ F x, u; a1 F x, u; a2 for all a1, a2 ∈ R, ii F x, u;αa αF x, u; a , for all α ∈ R and for all ...
متن کامل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-...
متن کاملSymmetric duality for a higher-order nondifferentiable multiobjective programming problem
*Correspondence: [email protected] 1Department of Mathematics, Indian Institute of Technology, Roorkee, 247 667, India Full list of author information is available at the end of the article Abstract In this paper, a pair of Wolfe type higher-order nondifferentiable symmetric dual programs over arbitrary cones has been studied and then well-suited duality relations have been established consider...
متن کاملHigher-Order Duality in Nondifferentiable Minimax Programming with Generalized Type I Functions
A unified higher-order dual for a nondifferentiable minimax programming problem is formulated. Weak, strong and strict converse duality theorems are discussed involving generalized higher-order (F,α,ρ, d)-Type I functions.
متن کاملHigher order symmetric duality in nondifferentiable multi-objective programming problems involving generalized cone convex functions
A pair of Mond–Weir type multi-objective higher order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under higher order K –F-convexity assumptions. Our results generalize several known results in the literature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2002
ISSN: 0022-247X
DOI: 10.1016/s0022-247x(02)00170-1