Abstract
A Mond-Weir type dual for a class of nondifferentiable minimax fractional programming problem is considered. Appropriate duality results are proved involving (F, α, ρ, d)-pseudoconvex functions.
| Original language | English |
|---|---|
| Pages (from-to) | 545-551 |
| Number of pages | 7 |
| Journal | Applied Mathematics and Computation |
| Volume | 176 |
| Issue number | 2 |
| DOIs | |
| State | Published - 15 May 2006 |
| Externally published | Yes |
Keywords
- Duality
- Fractional programming
- Generalized convexity
- Nondifferentiable minimax programming
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Duality in nondifferentiable minimax fractional programming with generalized convexity'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver