Abstract
We establish sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems involving (F, α, ρ, d)-convexity. Subsequently, we apply the optimality conditions to formulate two types of dual problems and prove appropriate duality theorems.
| Original language | English |
|---|---|
| Pages (from-to) | 255-275 |
| Number of pages | 21 |
| Journal | Journal of Optimization Theory and Applications |
| Volume | 129 |
| Issue number | 2 |
| DOIs | |
| State | Published - May 2006 |
| Externally published | Yes |
Keywords
- Duality
- Generalized convexity
- Minimax fractional programming
- Optimality conditions
- Sublinear functionals
ASJC Scopus subject areas
- Management Science and Operations Research
- Control and Optimization
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver