Invex nonsmooth alternative theorem and applications
Loading...
External sources
External sources
Date
Advisor
Coadvisor
Graduate program
Undergraduate course
Journal Title
Journal ISSN
Volume Title
Publisher
Taylor & Francis
Type
Article
Access right
Acesso restrito
External sources
External sources
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. © 2000 OPA (Overseas Publishers Association) N.V. Published by license under the Gordon and Breach Science Publishers imprint.
Description
Keywords
Language
English
Citation
Optimization, v. 48, n. 2, p. 239-253, 2000.
