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.
| Original language | English |
|---|---|
| Pages (from-to) | 239-253 |
| Number of pages | 15 |
| Journal | Optimization |
| Volume | 48 |
| Issue number | 2 |
| State | Published - 2000 |
| Externally published | Yes |
Keywords
- Alternative theorem
- Invexity
- Multiobjective programming
- Nonsmooth analysis
Fingerprint
Dive into the research topics of 'Invex nonsmooth alternative theorem and applications'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver