This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators ...This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.展开更多
A new conception of generalized set-valued Ф-hemi-contractive mapping in Banach spaces is presented. Some strong convergence theorems of Ishikawa and Mann iterative approximation with errors is proved. The results in...A new conception of generalized set-valued Ф-hemi-contractive mapping in Banach spaces is presented. Some strong convergence theorems of Ishikawa and Mann iterative approximation with errors is proved. The results in this paper improve and extend the earlier results.展开更多
A new concept of generalized set-valued strongly accretive mappings in Banach spaces was given and some strong convergence theorems of Ishikawa and Mann iterative process with errors approximation methods by Huang et ...A new concept of generalized set-valued strongly accretive mappings in Banach spaces was given and some strong convergence theorems of Ishikawa and Mann iterative process with errors approximation methods by Huang et al. was proved. The results presented in this paper improve and extend the earlier results obtained by Huang et al.展开更多
To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized dI-G-type Ⅰ invexity were introduced for nondifferentiable multiobjective programmi...To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized dI-G-type Ⅰ invexity were introduced for nondifferentiable multiobjective programming problems.Based upon these generalized invexity,G-Fritz-John （G-F-J） and G-Karnsh-Kuhn-Tucker （G-K-K-T） types sufficient optimality conditions were established for a feasible solution to be an efficient solution.Moreover,weak and strict duality results were derived for a G-Mond-Weir type dual under various types of generalized dI-G-type Ⅰ invexity assumptions.展开更多
The duality theorem of generalized weak smash coproducts of weak module coalgebras and comodule coalgebras over quantum groupoids is studied.Let H be a weak Hopf algebra,C a left weak H-comodule coalgebra and D a left...The duality theorem of generalized weak smash coproducts of weak module coalgebras and comodule coalgebras over quantum groupoids is studied.Let H be a weak Hopf algebra,C a left weak H-comodule coalgebra and D a left weak H-module coalgebra.First,a weak generalized smash coproduct C×lH D over quantum groupoids is defined and the module and comodule structures on it are constructed.The weak generalized right smash coproduct C×rL D is similar.Then some isomorph-isms between them are obtained.Secondly,by introducing some concepts of a weak convolution invertible element,a weak co-inner coaction and a strongly relative co-inner coaction,a sufficient condition for C×rH D to be isomorphic to Cv D is obtained,where v∈WC（C,H）and the coaction of H on D is right strongly relative co-inner.Finally,the duality theorem for a generalized smash coproduct over quantum groupoids,（C×lH H）×lH H≌Cv（H×lH H）,is obtained.展开更多
This paper proposes a nonmonotonic backtracking trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems.Using the duality theory of the linear programmin...This paper proposes a nonmonotonic backtracking trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems.Using the duality theory of the linear programming and convex theory,the generalized directional derivative of the general multicommodity minimal cost flow problems is derived.The global convergence and superlinear convergence rate of the proposed algorithm are established under some mild conditions.展开更多
Mond-Weir type duality for control problem with support functions is investigated under generalized convexity conditions. Special cases are derived. A relationship between our results and those of nonlinear programmin...Mond-Weir type duality for control problem with support functions is investigated under generalized convexity conditions. Special cases are derived. A relationship between our results and those of nonlinear programming problem containing support functions is outlined.展开更多
In this paper, we introduce a new class of generalized dI-univexity in which each component of the objective and constraint functions is directionally differentiable in its own direction di for a nondifferentiable mul...In this paper, we introduce a new class of generalized dI-univexity in which each component of the objective and constraint functions is directionally differentiable in its own direction di for a nondifferentiable multiobjective programming problem. Based upon these generalized functions, sufficient optimality conditions are established for a feasible point to be efficient and properly efficient under the generalised dI-univexity requirements. Moreover, weak, strong and strict converse duality theorems are also derived for Mond-Weir type dual programs.展开更多
A certain constrained dynamic game is shown to be equivalent to a pair of symmetric dual variational problems which have more general formulation than those already existing in the literature. Various duality results ...A certain constrained dynamic game is shown to be equivalent to a pair of symmetric dual variational problems which have more general formulation than those already existing in the literature. Various duality results are proved under convexity and generalized convexity assumptions on the appropriate functionals. The dynamic game is also viewed as equivalent to a pair of dual variational problems without the condition of fixed points. It is also indicated that the equivalent formulation of a pair of symmetric dual variational problems as dynamic generalization of those had been already studied in the literature. In essence, the purpose of the research is to establish that the solution of variational problems yields the solution of the dynamic game.展开更多
A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research t...A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of paramet- ric duality results under various generalized （η,ρ）-invexity assumptions for a semi-infinite minmax fractional programming problem.展开更多
This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized(C,α,ρ,d)-convex functions.The authors formulate Mond-Weir-...This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized(C,α,ρ,d)-convex functions.The authors formulate Mond-Weir-type dual model for the nonlinear nondifferentiable multiobjective semiinfinite programming problem and establish weak,strong and strict converse duality theorems relating the primal and the dual problems.展开更多
Let A,B be associative rings with identity,and(S.≤)a strictly totally ordered monoid which is also artinian and finitely generated.For any bimodule AaMB. we show that the bimodule [[A^(S.≤)]][M^(S.≤)][[B^(S.≤)]]de...Let A,B be associative rings with identity,and(S.≤)a strictly totally ordered monoid which is also artinian and finitely generated.For any bimodule AaMB. we show that the bimodule [[A^(S.≤)]][M^(S.≤)][[B^(S.≤)]]defines a Morita duality if and only if _AM_B defines a Morita duality and A is left noetherian.B is right noetherian.As a corollary,it.is shown that the ring[[A^(S.≤)]]of generalized power series over A has a Morita duality if and only if A is a left noetherian ring with a Morita duality induced by a bimodule _AM_B such that B is right noetherian.展开更多
This paper extends the class of generalized type I functions introduced by Aghezzaf and Hachimi（2000） to the context of higher-order case and formulate a number of higher-order duals to a non-differentiable multi-ob...This paper extends the class of generalized type I functions introduced by Aghezzaf and Hachimi（2000） to the context of higher-order case and formulate a number of higher-order duals to a non-differentiable multi-objective programming problem and establishes higher-order duality results under the higher-order generalized type I functions introduced in the present paper, A special case that appears repeatedly in the literature is that the support function is the square root of a positive semi-definite quadratic form. This and other special cases can be readily generated from these results.展开更多
In this paper, we present several parametric duality results under various generalized （a,v,p）-V- invexity assumptions for a semiinfinite multiobjective fractional programming problem.
In this paper,a new concept of generalized-affineness type of functions is introduced.This class of functions is more general than some of the corresponding ones discussed in Chuong(Nonlinear Anal Theory Methods Appl ...In this paper,a new concept of generalized-affineness type of functions is introduced.This class of functions is more general than some of the corresponding ones discussed in Chuong(Nonlinear Anal Theory Methods Appl 75:5044–5052,2018),Sach et al.(J Global Optim 27:51–81,2003)and Nobakhtian(Comput Math Appl 51:1385–1394,2006).These concepts are used to discuss the sufficient optimality conditions for the interval-valued programming problem in terms of the limiting/Mordukhovich subdifferential of locally Lipschitz functions.Furthermore,two types of dual problems,namely Mond–Weir type and mixed type duals are formulated for an interval-valued programming problem and usual duality theorems are derived.Our results improve and generalize the results appeared in Kummari and Ahmad(UPB Sci Bull Ser A 82(1):45–54,2020).展开更多
基金Supported by Chongqing Key Lab. of Operations Research and System Engineering
文摘This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.
文摘A new conception of generalized set-valued Ф-hemi-contractive mapping in Banach spaces is presented. Some strong convergence theorems of Ishikawa and Mann iterative approximation with errors is proved. The results in this paper improve and extend the earlier results.
基金The foundation project of Chengdu University of Information Technology (No.CRF200502)
文摘A new concept of generalized set-valued strongly accretive mappings in Banach spaces was given and some strong convergence theorems of Ishikawa and Mann iterative process with errors approximation methods by Huang et al. was proved. The results presented in this paper improve and extend the earlier results obtained by Huang et al.
基金National Natural Science Foundation of China(No.11071110)
文摘To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized dI-G-type Ⅰ invexity were introduced for nondifferentiable multiobjective programming problems.Based upon these generalized invexity,G-Fritz-John （G-F-J） and G-Karnsh-Kuhn-Tucker （G-K-K-T） types sufficient optimality conditions were established for a feasible solution to be an efficient solution.Moreover,weak and strict duality results were derived for a G-Mond-Weir type dual under various types of generalized dI-G-type Ⅰ invexity assumptions.
基金The National Natural Science Foundation of China(No.10871042)the Natural Science Foundation of Jiangsu Province(No.BK2009258)
文摘The duality theorem of generalized weak smash coproducts of weak module coalgebras and comodule coalgebras over quantum groupoids is studied.Let H be a weak Hopf algebra,C a left weak H-comodule coalgebra and D a left weak H-module coalgebra.First,a weak generalized smash coproduct C×lH D over quantum groupoids is defined and the module and comodule structures on it are constructed.The weak generalized right smash coproduct C×rL D is similar.Then some isomorph-isms between them are obtained.Secondly,by introducing some concepts of a weak convolution invertible element,a weak co-inner coaction and a strongly relative co-inner coaction,a sufficient condition for C×rH D to be isomorphic to Cv D is obtained,where v∈WC（C,H）and the coaction of H on D is right strongly relative co-inner.Finally,the duality theorem for a generalized smash coproduct over quantum groupoids,（C×lH H）×lH H≌Cv（H×lH H）,is obtained.
基金the National Natural Science Foundation of China ( 1 0 4 71 0 94) ,the ScienceFoundation of Shanghai Technical Sciences Committee ( 0 2 ZA1 40 70 ) and the Science Foundation ofShanghai Education Committee( 0 2 DK0 6)
文摘This paper proposes a nonmonotonic backtracking trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems.Using the duality theory of the linear programming and convex theory,the generalized directional derivative of the general multicommodity minimal cost flow problems is derived.The global convergence and superlinear convergence rate of the proposed algorithm are established under some mild conditions.
文摘Mond-Weir type duality for control problem with support functions is investigated under generalized convexity conditions. Special cases are derived. A relationship between our results and those of nonlinear programming problem containing support functions is outlined.
文摘In this paper, we introduce a new class of generalized dI-univexity in which each component of the objective and constraint functions is directionally differentiable in its own direction di for a nondifferentiable multiobjective programming problem. Based upon these generalized functions, sufficient optimality conditions are established for a feasible point to be efficient and properly efficient under the generalised dI-univexity requirements. Moreover, weak, strong and strict converse duality theorems are also derived for Mond-Weir type dual programs.
文摘A certain constrained dynamic game is shown to be equivalent to a pair of symmetric dual variational problems which have more general formulation than those already existing in the literature. Various duality results are proved under convexity and generalized convexity assumptions on the appropriate functionals. The dynamic game is also viewed as equivalent to a pair of dual variational problems without the condition of fixed points. It is also indicated that the equivalent formulation of a pair of symmetric dual variational problems as dynamic generalization of those had been already studied in the literature. In essence, the purpose of the research is to establish that the solution of variational problems yields the solution of the dynamic game.
文摘A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of paramet- ric duality results under various generalized （η,ρ）-invexity assumptions for a semi-infinite minmax fractional programming problem.
文摘This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized(C,α,ρ,d)-convex functions.The authors formulate Mond-Weir-type dual model for the nonlinear nondifferentiable multiobjective semiinfinite programming problem and establish weak,strong and strict converse duality theorems relating the primal and the dual problems.
基金supported by National Natural Science Foundation of China(10171082)Foundation for University Key Teacherthe Ministry of Education(GG-110-10736-1001)
文摘Let A,B be associative rings with identity,and(S.≤)a strictly totally ordered monoid which is also artinian and finitely generated.For any bimodule AaMB. we show that the bimodule [[A^(S.≤)]][M^(S.≤)][[B^(S.≤)]]defines a Morita duality if and only if _AM_B defines a Morita duality and A is left noetherian.B is right noetherian.As a corollary,it.is shown that the ring[[A^(S.≤)]]of generalized power series over A has a Morita duality if and only if A is a left noetherian ring with a Morita duality induced by a bimodule _AM_B such that B is right noetherian.
文摘This paper extends the class of generalized type I functions introduced by Aghezzaf and Hachimi（2000） to the context of higher-order case and formulate a number of higher-order duals to a non-differentiable multi-objective programming problem and establishes higher-order duality results under the higher-order generalized type I functions introduced in the present paper, A special case that appears repeatedly in the literature is that the support function is the square root of a positive semi-definite quadratic form. This and other special cases can be readily generated from these results.
文摘In this paper, we present several parametric duality results under various generalized （a,v,p）-V- invexity assumptions for a semiinfinite multiobjective fractional programming problem.
文摘In this paper,a new concept of generalized-affineness type of functions is introduced.This class of functions is more general than some of the corresponding ones discussed in Chuong(Nonlinear Anal Theory Methods Appl 75:5044–5052,2018),Sach et al.(J Global Optim 27:51–81,2003)and Nobakhtian(Comput Math Appl 51:1385–1394,2006).These concepts are used to discuss the sufficient optimality conditions for the interval-valued programming problem in terms of the limiting/Mordukhovich subdifferential of locally Lipschitz functions.Furthermore,two types of dual problems,namely Mond–Weir type and mixed type duals are formulated for an interval-valued programming problem and usual duality theorems are derived.Our results improve and generalize the results appeared in Kummari and Ahmad(UPB Sci Bull Ser A 82(1):45–54,2020).
