Abstract
A second-order dual is formulated for a nondifferentiable fractional programming problem. Using the generalized second-order (F,α,ρ,d)- convexity assumptions on the functions involved, weak, strong and converse duality theorems are established in order to relate the primal and dual problems.
| Original language | English |
|---|---|
| Pages (from-to) | 1103-1110 |
| Number of pages | 8 |
| Journal | Nonlinear Analysis: Real World Applications |
| Volume | 12 |
| Issue number | 2 |
| DOIs | |
| State | Published - Apr 2011 |
Keywords
- Fractional programming
- Generalized convexity
- Optimal solutions
- Second-order duality
ASJC Scopus subject areas
- Analysis
- General Engineering
- General Economics, Econometrics and Finance
- Computational Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Second-order duality in nondifferentiable fractional programming'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver