Partial and Generalized Subconvexity in Vector Optimization Problems

This paper studies necessary conditions of weak efficiency of a constrained vector minimization problem with equality and inequality constraints in real linear spaces. These results are obtained under generalized convexity conditions through new alternative theorems and given in linear operator rules form. We present a relaxed subconvexlikeness and generalized subconvexlikeness, and likewise, define and related to this, other new concepts such as partial subconvexlikeness and partial generalized subconvexlikeness.