Abstract
A class of functions, called pre-invex, is defined. These functions are more general than convex functions and when differentiable are invex. Optimality conditions and duality theorems are given for both scalar-valued and vector-valued programs involving pre-invex functions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have