Optimality of a Class of Symmetric Differentiable Invex Multi-objective Programming
Multi-objective programming and generalized convexity are important research contents of optimization theory.Mainly using the Minch symmetric gradient,a class of symmetric differentiable G-Bs-(p,r,ρ)invex functions is defined,and a multi-objective programming problem with inequality constraints is established by using this function,and finally the sufficient optimality conditions under the convexity limit of the function are proved,which further broadens the conclusions on the optimality conditions in the literature involving B-(p,r)invex functions and G-ρ invex functions.
万方数据
维普
