نتایج جستجو برای: convex semi infinite programming
تعداد نتایج: 567949 فیلتر نتایج به سال:
This paper deals with a nonlinear multiobjective semi-infinite programming problem involving generalized (C,α, ρ, d)-convex functions. We obtain sufficient optimality conditions and formulate the Mond-Weirtype dual model for the nonlinear multiobjective semi-infinite programming problem. We also establish weak, strong and strict converse duality theorems relating the problem and the dual problem.
linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints. in this paper, to solve this problem, we combine a discretization method and a neural network method. by a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem. then, we use...
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...
A convex body K in R has associated with it a unique circumscribed ellipsoid CE(K) with minimum volume, and a unique inscribed ellipsoid IE(K) with maximum volume. We first give a unified, modern exposition of the basic theory of these extremal ellipsoids using the semi–infinite programming approach pioneered by Fritz John in his seminal 1948 paper. We then investigate the automorphism groups o...
By considering the epigraphs of conjugate functions, we extend the Fenchel duality, applicable to a (possibly infinite) family of proper lower semicontinuous convex functions on a Banach space. Applications are given in providing fuzzy KKT conditions for semi-infinite programming.
In this paper new results are established in multiobjective DC programming with infinite convex constraints (MOPIC for abbr.) that are defined on Banach space (finite or infinite) with objectives given as the difference of convex functions subject to infinite convex constraints. This problem can also be called multiobjective DC semi-infinite and infinite programming, where decision variables ru...
The aim of this paper is to deal with a class of multiobjective semi-infinite programming problem. For such problem, several necessary optimality conditions are established and proved using the powerful tool of K − subdifferential and the generalized convexity namely generalized uniform ( , , , ) K F d α ρ − − convexity. We also formulate the Wolf type dual models for the semi-infinite programm...
In generalized semi-infinite programming the feasible set is known to be not closed in general. In this paper, under natural and generic assumptions, the closure of the feasible set is described in explicit terms.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید