To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized d I-G-type I 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 d I-G-type I invexity were introduced for nondifferentiable multiobjective programming problems.Based upon these generalized invexity,G-Fritz-John(G-F-J)and G-KarushKuhn-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 GMond-Weir type dual under various types of generalized d I-G-type I invexity assumptions.展开更多
By extending the usual Wigner operator to the s-parameterized one as 1/4π2 integral （dyduexp [iu（q-Q）＋iy（p-P）＋is/2yu]） from n=- ∞ to ∞ with s beng a,real parameter,we propose a generalized Weyl quantization...By extending the usual Wigner operator to the s-parameterized one as 1/4π2 integral （dyduexp [iu（q-Q）＋iy（p-P）＋is/2yu]） from n=- ∞ to ∞ with s beng a,real parameter,we propose a generalized Weyl quantization scheme which accompanies a new generalized s-parameterized ordering rule.This rule recovers P-Q ordering,Q-P ordering,and Weyl ordering of operators in s = 1,1,0 respectively.Hence it differs from the Cahill-Glaubers’ ordering rule which unifies normal ordering,antinormal ordering,and Weyl ordering.We also show that in this scheme the s-parameter plays the role of correlation between two quadratures Q and P.The formula that can rearrange a given operator into its new s-parameterized ordering is presented.展开更多
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.展开更多
First, a class of higher order exponential type hybrid （α,β, γ, η, p, h（.,.）, κ（., .）, w（.,., .）, ω（.,.,.）, θ）-invexities is introduced, second, some parametrically sufficient efficiency conditions ba...First, a class of higher order exponential type hybrid （α,β, γ, η, p, h（.,.）, κ（., .）, w（.,., .）, ω（.,.,.）, θ）-invexities is introduced, second, some parametrically sufficient efficiency conditions based on the higher order exponential type hybrid invexities are established, and finally some parametrically sufficient efficiency results under the higher order exponential type hybrid （a,β, γ, ρ, h（.,.）, k（.,-）, w（-,., .）, w（.,., .）, 0）-invexities are investigated to the context of solving semiinfinite multiobjective fractional programming problems. The notions of the higher order exponential type hybrid （a, β, γ η, p, h（., .）, n（., .）, w（-,.,-）, ω（.,.,.）, 0）-invexities encompass most of the generalized invexities in the literature. To the best of our knowledge, the results on semiinfinite multiobjective fractional programming problems established in this communication are new and application-oriented toward multitime multi- objectve problems as well as multiobiective control problems.展开更多
基金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 d I-G-type I invexity were introduced for nondifferentiable multiobjective programming problems.Based upon these generalized invexity,G-Fritz-John(G-F-J)and G-KarushKuhn-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 GMond-Weir type dual under various types of generalized d I-G-type I invexity assumptions.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 11175113 and 11147009)the Natural Science Foundation of Shandong Province of China (Grant No. ZR2010AQ027)the Program of Higher Educational Science and Technology of Shandong Province,China (Grant No. J10LA15)
文摘By extending the usual Wigner operator to the s-parameterized one as 1/4π2 integral （dyduexp [iu（q-Q）＋iy（p-P）＋is/2yu]） from n=- ∞ to ∞ with s beng a,real parameter,we propose a generalized Weyl quantization scheme which accompanies a new generalized s-parameterized ordering rule.This rule recovers P-Q ordering,Q-P ordering,and Weyl ordering of operators in s = 1,1,0 respectively.Hence it differs from the Cahill-Glaubers’ ordering rule which unifies normal ordering,antinormal ordering,and Weyl ordering.We also show that in this scheme the s-parameter plays the role of correlation between two quadratures Q and P.The formula that can rearrange a given operator into its new s-parameterized ordering is presented.
文摘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.
文摘First, a class of higher order exponential type hybrid （α,β, γ, η, p, h（.,.）, κ（., .）, w（.,., .）, ω（.,.,.）, θ）-invexities is introduced, second, some parametrically sufficient efficiency conditions based on the higher order exponential type hybrid invexities are established, and finally some parametrically sufficient efficiency results under the higher order exponential type hybrid （a,β, γ, ρ, h（.,.）, k（.,-）, w（-,., .）, w（.,., .）, 0）-invexities are investigated to the context of solving semiinfinite multiobjective fractional programming problems. The notions of the higher order exponential type hybrid （a, β, γ η, p, h（., .）, n（., .）, w（-,.,-）, ω（.,.,.）, 0）-invexities encompass most of the generalized invexities in the literature. To the best of our knowledge, the results on semiinfinite multiobjective fractional programming problems established in this communication are new and application-oriented toward multitime multi- objectve problems as well as multiobiective control problems.
