Invex nonsmooth alternative theorem and applications^*

^*This research was supported by CNPq and FAPESP of Brazil

Abstract

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

Keywords:

• Invexity
• Nonsmooth Analysis
• Alternative Theorem
• Multiobjective Programming

^*This research was supported by CNPq and FAPESP of Brazil

^*Corresponding Author

^*This research was supported by CNPq and FAPESP of Brazil

^*Corresponding Author

Notes

^*This research was supported by CNPq and FAPESP of Brazil

^*Corresponding Author