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.展开更多
A new concept of(Φ,ρ,α)-V-invexity for differentiable vector-valued functions is introduced,which is a generalization of differentiable scalar-valued(Φ,ρ)-invexity.Based upon the(Φ,ρ,α)-V-invex functions,suffi...A new concept of(Φ,ρ,α)-V-invexity for differentiable vector-valued functions is introduced,which is a generalization of differentiable scalar-valued(Φ,ρ)-invexity.Based upon the(Φ,ρ,α)-V-invex functions,sufficient optimality conditions and MondWeir type dual theorems are derived for a class of nondifferentiable multiobjective fractional programming problems in which every component of the objective function and each constraint function contain a term involving the support function of a compact convex set.展开更多
This paper gives a new dual problem for nondifferentiable convex programming and provesthe properties of weak duality and strong duality and offers a necessary and sufficient condition ofstrong duality.
基金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.
基金National Natural Science Foundation of China(No.11071110)
文摘A new concept of(Φ,ρ,α)-V-invexity for differentiable vector-valued functions is introduced,which is a generalization of differentiable scalar-valued(Φ,ρ)-invexity.Based upon the(Φ,ρ,α)-V-invex functions,sufficient optimality conditions and MondWeir type dual theorems are derived for a class of nondifferentiable multiobjective fractional programming problems in which every component of the objective function and each constraint function contain a term involving the support function of a compact convex set.
文摘This paper gives a new dual problem for nondifferentiable convex programming and provesthe properties of weak duality and strong duality and offers a necessary and sufficient condition ofstrong duality.
