Higher-order V-invexity and Higher-order Duality in Non-differentiable Mathematical Programming

In this paper,we introduce a class of Mond-weir higher-order duality in non-differentiable mathematical programming problem and the notions of higher-order V-invexity and higher-order generalized V-invexity.Moreove,based on the researches of Mishra and Rueda.the weak and strong duality theorems are established under higher-order V-invexity assumption.Finally,under the weaker higher-order generalized V-invexity,the weak and strong duality theorems are established.