Abstract

In this paper, we introduce new classes of vector functions which generalize the class of scalar invex functions. We prove that these new classes of vector functions are characterized in such a way that every vector critical point is an efficient solution of a Multiobjective Programming Problem. We establish relationships between these new classes of functions and others used in the study of efficient and weakly efficient solutions.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call