Multiobjective Programming under Generalized Type I Invexity

In this paper we extend a (scalarized) generalized type-I invexity into a vector invexity (V-type I). A number of sufficiency results are established using Lagrange multiplier conditions and under various types of generalized V-type I requirements. Weak, strong, and converse duality theorems are proved in the generalized V-invexity type I setting.