Necessary Conditions for Suboptimization over the Weakly Efficient Set Associated to Generalized Invex Multiobjective Programming

The problem of optimizing a real-valued function over the weakly efficient set associated to a multiobjective program is examined. Two types of necessary conditions for suboptimizing the solution of the general problem are presented, which are somewhat similar to Theorem 4.1 of S. Bolintineanu J. Optim. Theory Appl. 78, 1993, 579]598., but under much weaker assumptions.