[PDF] Top 20 Optimality conditions of E convex programming for an E differentiable function

... 2. Youness, EA: Optimality criteria in E-convex programming. Chaos Solitons Fractals 12, 1737-1745 (2001) 3. Chen, X: Some properties of semi-E-convex functions. J. Math. Anal. ... See full document

... support function in the integrand of the objective func- tional and each inequality constraint ...function. Optimality conditions for this nondifferentiable control problem are derived and ... See full document

... ity conditions in invex optimization problems with an interval-valued objective function were discussed by Zhang et ...the optimality conditions for interval-valued ob- jective functions under ... See full document

... Optimality conditions of a nonlinear programming problem with fuzzy parameters are established, and a fuzzy function is defined, with its differentiability, convexity, and some important ... See full document

... type optimality conditions for cone invex programs, and Jeyakumar and Mond 6 introduced the class of the so-called V-invex functions to proved some optimality for a class of differentiable vector ... See full document

... the optimality conditions of [1], Tanimoto [2] defined a first-order dual problem of , which gene- ralized the duality theorems for convex minimax pro- gramming problems considered by Weir [3] and ... See full document

... harmonic convex functions with respect to an arbitrary function ...convex function. One can show that the generalized strongly harmonic convex functions is quite general and unified ... See full document

... Proof Since x ∗ is an optimal solution for (P) and all the conditions of Theorem . are satisfied, there exist (s ∗ , λ ∗ , y ∗ ) ∈ K , and (x ∗ , μ ∗ ) ∈ H (s ∗ , λ ∗ , y ∗ ) such that (x ∗ , μ ∗ , s ∗ , λ ∗ , y ... See full document

... objective function of himself and reacts the lower-level decision making variable z which is an optimal solution of the lower-level ...bilevel programming with nonunique lower-level solutions, they gave an ... See full document

... linear programming due to its symmetry in shape and properties of convex sets and ...of convex sets and convex functions have been introduced and investigated, which make this area of research ... See full document

... To establish the dual problem we use the duality theo- rems of operations of addition and infimal convolution of convex functions. Here a remarkable specific feature of second order elliptic partial differential ... See full document

... ity conditions in bilevel multiobjective optimization, in the general case were both the higher and the lower level problems are ...by optimality con- ditions given by ...ity conditions for a ... See full document

... inverse function theorem and implicit theorem and solve nondifferential inclusion problems ...of convex set-valued mappings and established necessary and sufficient op- timality conditions for the weak ... See full document

... non-linear programming problems, it might appear a bit difficult but there are several fundamental theorems that can be utilized to guide our search even in the face of such ...such conditions as ... See full document

... of convex functions, where G is a continuous real-valued increasing ...some optimality conditions for constrained optimization problems under the assumption of ... See full document

... that E(t, λ) = min { λt, t } , t ∈ R, λ ∈ [, ], then, for each x ∈ M, we have (x–y) ∇ f (y) ≤ f (x) – f ...regards E-[, ] convex functions, see ...valued function f : M ⊆ R n → R is said ... See full document

... fractional programming problems containing ρ-convex func- tions have been established by Zalmai ...these optimality criteria as a basis for constructing two parametric and four parameter-free duality ... See full document

... on E-convex programming in Youness [] were not correct, and some counterexamples were given by Yang ...an E-convex function f in terms of its E-epigraph in Youness [] ... See full document

... locally convex Hausdorff topological vector spaces, whose respective dual spaces, X ∗ and Y ∗ , are endowed with the weak ∗ -topologies w ∗ X ∗ , X and w ∗ Y ∗ , Y ...proper convex functions, and let A : X → ... See full document

... The optimality conditions of differentiable convex functions are characterized by variational inequalities, the origin of which can be traced back to Euler, Lagrange and ...hand, convex ... See full document