Invex nonsmooth alternative theorem and applications

Brandao, A. J VRojas-Medar, M. A.Silva, Geraldo Nunes [UNESP]2014-05-272014-05-272000-12-01Optimization, v. 48, n. 2, p. 239-253, 2000.0233-1934http://hdl.handle.net/11449/66315An 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. © 2000 OPA (Overseas Publishers Association) N.V. Published by license under the Gordon and Breach Science Publishers imprint.239-253engAlternative theoremInvexityMultiobjective programmingNonsmooth analysisInvex nonsmooth alternative theorem and applicationsArtigo10.1080/02331930008844504Acesso restrito2-s2.0-00430592723638688119433520