Some properties of convex cones are obtained and are used to derive several equivalent conditions as well as another important property for nearly cone-subconvexlike set-valued functions. Under the assumption of nearl...Some properties of convex cones are obtained and are used to derive several equivalent conditions as well as another important property for nearly cone-subconvexlike set-valued functions. Under the assumption of nearly cone-subconvexlikeness,a Lagrangian multiplier theorem on Benson proper efficiency is presented. Related results are generalized.展开更多
A kind of tangent derivative and the concepts of strong and weak * pseudoconvexity for a set-valued map are introduced. By the standard separation theorems of the convex sets and cones the optimality Fritz John condit...A kind of tangent derivative and the concepts of strong and weak * pseudoconvexity for a set-valued map are introduced. By the standard separation theorems of the convex sets and cones the optimality Fritz John condition of set-valued optimization under Benson proper efficiency is established, its sufficience is discussed. The form of the optimality conditions obtained here completely tally with the classical results when the set-valued map is specialized to be a single-valued map.展开更多
Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. U...Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. Under the assumption of generalized subconvexlikeness, scalarization, multiplier and saddle point theorems are obtained in the sense of Benson proper efficiency.展开更多
The behavior of the perturbation map is analyzed quantitatively by using the concept of contingent derivatives for set-valued maps under Benson proper efficiency. Let W(u) = Pmin[G(u),S],y∧∈W(u∧). It is shown that,...The behavior of the perturbation map is analyzed quantitatively by using the concept of contingent derivatives for set-valued maps under Benson proper efficiency. Let W(u) = Pmin[G(u),S],y∧∈W(u∧). It is shown that, under some conditions, DW(u∧,y∧) Pmin[DG(u∧,y∧),S] , and under some other conditions, DW(u∧,y∧) Pmin[DG(u∧,y∧),S].展开更多
The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary con...The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are obtained.展开更多
In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized pr...In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. It is demonstrated that how adding variables to the scalarized problem, can lead to find conditions for (weakly, properly) Pareto optimal solutions. Applying the obtained necessary and sufficient conditions, two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed. These algorithms are easy to implement and can achieve an even approximation of (weakly, properly) Pareto optimal solutions. These algorithms can be generalized for optimization problems with more than three criterion functions, too. The effectiveness and capability of the algorithms are demonstrated in test problems.展开更多
In this paper some optimality criteria are proved and some Mond-Weir type duality theorem for multiobjective fractional programming problems defined in a Banach space is obtained.
The existence conditions of globally proper efficient points and a useful property of ic- cone-convexlike set-valued maps are obtained. Under the assumption of the ic-cone-convexlikeness, the optimality conditions for...The existence conditions of globally proper efficient points and a useful property of ic- cone-convexlike set-valued maps are obtained. Under the assumption of the ic-cone-convexlikeness, the optimality conditions for globally proper efficient solutions are established in terms of Lagrange multipliers. The new concept of globally proper saddle-point for an appropriate set-valued Lagrange map is introduced and used to characterize the globally proper efficient solutions. The results which are obtained in this paper are proven under the conditions that the ordering cone need not to have a nonempty interior.展开更多
The subgradient, under the weak Benson proper efficiency, of a set-valued mapping in ordered Banach space is developed, and the weak Benson proper efficient Hahn-Banach theorem of a set-valued mapping is established, ...The subgradient, under the weak Benson proper efficiency, of a set-valued mapping in ordered Banach space is developed, and the weak Benson proper efficient Hahn-Banach theorem of a set-valued mapping is established, with which the existence of the subgradient is proved and the characterizations of weak Benson proper efficient elements of constrained(unconstrained) vector set-valued optimization problems are presented.展开更多
Applying the theory of locally convex spaces to vector optimization, we investigate the relationship between Henig proper efficient points and generalized Henig proper efficient points. In particular, we obtain a suff...Applying the theory of locally convex spaces to vector optimization, we investigate the relationship between Henig proper efficient points and generalized Henig proper efficient points. In particular, we obtain a sufficient and necessary condition for generalized Henig proper efficient points to be Henig proper efficient points. From this, we derive several convenient criteria for judging Henig proper efficient points.展开更多
In this paper,we study the connectedness of proper efficient solution sets of the vector optimization problem for a strict cone--quasiconvex mapping in a separated topological linear space.
In this paper, firstly, a new notion of generalized cone convex set-valued map is introduced in real normed spaces. Secondly, a property of the generalized cone convex set-valued map involving the contingent epideriva...In this paper, firstly, a new notion of generalized cone convex set-valued map is introduced in real normed spaces. Secondly, a property of the generalized cone convex set-valued map involving the contingent epiderivative is obtained. Finally, as the applications of this property, we use the contingent epiderivative to establish optimality conditions of the set-valued optimization problem with generalized cone convex set-valued maps in the sense of Henig proper efficiency. The results obtained in this paper generalize and improve some known results in the literature.展开更多
The concept of a cone subarcwise connected set-valued map is introduced. Several examples are given to illustrate that the cone subarcwise connected set-valued map is a proper generalization of the cone arcwise connec...The concept of a cone subarcwise connected set-valued map is introduced. Several examples are given to illustrate that the cone subarcwise connected set-valued map is a proper generalization of the cone arcwise connected set-valued map, as well as the arcwise connected set is a proper generalization of the convex set,respectively. Then, by virtue of the generalized second-order contingent epiderivative, second-order necessary optimality conditions are established for a point pair to be a local global proper efficient element of set-valued optimization problems. When objective function is cone subarcwise connected, a second-order sufficient optimality condition is also obtained for a point pair to be a global proper efficient element of set-valued optimization problems.展开更多
This paper studies the known density theorem of Arrow- Barankin-Blackwell. T he following main result is obtained: If X is a Hausdorff locally convex topological space and C X is a closed convex cone with bounded bas...This paper studies the known density theorem of Arrow- Barankin-Blackwell. T he following main result is obtained: If X is a Hausdorff locally convex topological space and C X is a closed convex cone with bounded base, then for every nonempty weakly compact convex subset A, the set of positive proper efficient points of A is dense in the set of efficient points of A.展开更多
Using generalized univex functions, a nondifferentiable multiple-objective optimization problem is considered.Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point to be an efficient or p...Using generalized univex functions, a nondifferentiable multiple-objective optimization problem is considered.Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point to be an efficient or properly efficient solution. Mond-Weir type duality programming is constructed,the weak and strong duality theorems are proved.展开更多
文摘Some properties of convex cones are obtained and are used to derive several equivalent conditions as well as another important property for nearly cone-subconvexlike set-valued functions. Under the assumption of nearly cone-subconvexlikeness,a Lagrangian multiplier theorem on Benson proper efficiency is presented. Related results are generalized.
文摘A kind of tangent derivative and the concepts of strong and weak * pseudoconvexity for a set-valued map are introduced. By the standard separation theorems of the convex sets and cones the optimality Fritz John condition of set-valued optimization under Benson proper efficiency is established, its sufficience is discussed. The form of the optimality conditions obtained here completely tally with the classical results when the set-valued map is specialized to be a single-valued map.
文摘Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. Under the assumption of generalized subconvexlikeness, scalarization, multiplier and saddle point theorems are obtained in the sense of Benson proper efficiency.
基金Supported by the National Natural Science Foundation of China(69972036)
文摘The behavior of the perturbation map is analyzed quantitatively by using the concept of contingent derivatives for set-valued maps under Benson proper efficiency. Let W(u) = Pmin[G(u),S],y∧∈W(u∧). It is shown that, under some conditions, DW(u∧,y∧) Pmin[DG(u∧,y∧),S] , and under some other conditions, DW(u∧,y∧) Pmin[DG(u∧,y∧),S].
文摘The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are obtained.
文摘In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. It is demonstrated that how adding variables to the scalarized problem, can lead to find conditions for (weakly, properly) Pareto optimal solutions. Applying the obtained necessary and sufficient conditions, two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed. These algorithms are easy to implement and can achieve an even approximation of (weakly, properly) Pareto optimal solutions. These algorithms can be generalized for optimization problems with more than three criterion functions, too. The effectiveness and capability of the algorithms are demonstrated in test problems.
文摘In this paper some optimality criteria are proved and some Mond-Weir type duality theorem for multiobjective fractional programming problems defined in a Banach space is obtained.
基金Supported by Natural Science Foundation of Ningxia (No.NZ0959)Natural Science Foundation of the State Ethnic Affairs Commission of PRC (No.09BF06)Natural Science Foundation for the Youth (No.10901004)
文摘The existence conditions of globally proper efficient points and a useful property of ic- cone-convexlike set-valued maps are obtained. Under the assumption of the ic-cone-convexlikeness, the optimality conditions for globally proper efficient solutions are established in terms of Lagrange multipliers. The new concept of globally proper saddle-point for an appropriate set-valued Lagrange map is introduced and used to characterize the globally proper efficient solutions. The results which are obtained in this paper are proven under the conditions that the ordering cone need not to have a nonempty interior.
基金This research is supportedby the National Natural Science Foundation of China(69972036), the Natural Science Foundation of Shaan
文摘The subgradient, under the weak Benson proper efficiency, of a set-valued mapping in ordered Banach space is developed, and the weak Benson proper efficient Hahn-Banach theorem of a set-valued mapping is established, with which the existence of the subgradient is proved and the characterizations of weak Benson proper efficient elements of constrained(unconstrained) vector set-valued optimization problems are presented.
基金Supported by the National Natural Science Foundation of China (10571035, 10871141)
文摘Applying the theory of locally convex spaces to vector optimization, we investigate the relationship between Henig proper efficient points and generalized Henig proper efficient points. In particular, we obtain a sufficient and necessary condition for generalized Henig proper efficient points to be Henig proper efficient points. From this, we derive several convenient criteria for judging Henig proper efficient points.
文摘In this paper,we study the connectedness of proper efficient solution sets of the vector optimization problem for a strict cone--quasiconvex mapping in a separated topological linear space.
基金supported by the National Nature Science Foundation of China(11431004,11471291)the General Project of Chongqing Frontier and Applied Foundation Research(cstc2015jcyj A00050)the Key Project of Chongqing Frontier and Applied Foundation Research(cstc2017jcyj BX0055,cstc2015jcyj BX0113)
文摘In this paper, firstly, a new notion of generalized cone convex set-valued map is introduced in real normed spaces. Secondly, a property of the generalized cone convex set-valued map involving the contingent epiderivative is obtained. Finally, as the applications of this property, we use the contingent epiderivative to establish optimality conditions of the set-valued optimization problem with generalized cone convex set-valued maps in the sense of Henig proper efficiency. The results obtained in this paper generalize and improve some known results in the literature.
基金Supported by the National Natural Science Foundation of China Grant 11461044the Natural Science Foundation of Jiangxi Province(20151BAB201027)the Science and Technology Foundation of the Education Department of Jiangxi Province(GJJ12010)
文摘The concept of a cone subarcwise connected set-valued map is introduced. Several examples are given to illustrate that the cone subarcwise connected set-valued map is a proper generalization of the cone arcwise connected set-valued map, as well as the arcwise connected set is a proper generalization of the convex set,respectively. Then, by virtue of the generalized second-order contingent epiderivative, second-order necessary optimality conditions are established for a point pair to be a local global proper efficient element of set-valued optimization problems. When objective function is cone subarcwise connected, a second-order sufficient optimality condition is also obtained for a point pair to be a global proper efficient element of set-valued optimization problems.
文摘This paper studies the known density theorem of Arrow- Barankin-Blackwell. T he following main result is obtained: If X is a Hausdorff locally convex topological space and C X is a closed convex cone with bounded base, then for every nonempty weakly compact convex subset A, the set of positive proper efficient points of A is dense in the set of efficient points of A.
基金Shandong Science Development Plan Foundation ( NO.JOOP 55)
文摘Using generalized univex functions, a nondifferentiable multiple-objective optimization problem is considered.Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point to be an efficient or properly efficient solution. Mond-Weir type duality programming is constructed,the weak and strong duality theorems are proved.
