نتایج جستجو برای: Generalized n-set convex function
تعداد نتایج: 2717715 فیلتر نتایج به سال:
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
in this paper, we first present a new important property for bouligand tangent cone (contingent cone) of a star-shaped set. we then establish optimality conditions for pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
In this paper, a new inequality for generalized convex functions which is related to the left side of generalized Hermite-Hadamard type inequality is obtained. Some applications for some generalized special means are also given.
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
The aim of this paper is to show that under a mild semicontinuity assumption (the so-called segmentary epi-closedness), the cone-convex (resp. cone-quasiconvex) set-valued maps can be characterized in terms of weak cone-convexity (resp. weak cone-quasiconvexity), i.e. the notions obtained by replacing in the classical definitions the conditions of type ”for all x, y in the domain and for all t ...
let $x$ be a real normed space, then $c(subseteq x)$ is functionally convex (briefly, $f$-convex), if $t(c)subseteq bbb r $ is convex for all bounded linear transformations $tin b(x,r)$; and $k(subseteq x)$ is functionally closed (briefly, $f$-closed), if $t(k)subseteq bbb r $ is closed for all bounded linear transformations $tin b(x,r)$. we improve the krein-milman theorem ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید