Invex nonsmooth alternative theorem and applications*
A.J.V Brando, Marko Antonio Rojas-Medar, G.N Silva · Optimization · 2000
An invex constrained nonsmooth optimization problem is considered, in which the presence of an abstract constraint set is possibly allowed. Necessary and sufficient conditions of optimality are provided and weak and strong duality results established. Following Geoffrion’s approach an invex nonsmooth alternative theorem of Gordan type is then derived. Subsequently, some applications on multiobjective programming are then pursued