Optimality conditoins of G-ρ invex multi-objective programming
Convex function promotion plays an important role in optimisation theory.Using the local Lipschitz function,a multi-objective programming problem with inequality constraints was established based on the G-ρ invex func-tion,G-ρ quasi-invex function and G-ρ pseudo-invex function.The sufficient condition of optimality under the convexity constraint was proved,which extended the existing conclusions to the weaker convexity condition.
NETL
NSTL
万方数据
