Abstract
An infinite programming problem consists in minimizing a functional defined on a real Banach space under an infinite number of constraints. The main purpose of this article is to provide sufficient conditions of optimality under generalized convexity assumptions. Such conditions are necessarily satisfied when the problem possesses the property that every stationary point is a global minimizer.
| Original language | English |
|---|---|
| Pages (from-to) | 1131-1147 |
| Number of pages | 17 |
| Journal | Optimization Letters |
| Volume | 9 |
| Issue number | 6 |
| DOIs | |
| State | Published - 29 Aug 2015 |
| Externally published | Yes |
Keywords
- Generalized convexity
- Infinite programming
- Nonlinear programming
- Sufficient conditions
Fingerprint
Dive into the research topics of 'Optimality conditions for nonlinear infinite programming problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver