Abstract
In this paper, we study a nondifferentiable minimax fractional programming problem under the assumptions of generalized second order (F, α, ρ, d)-convexity. A second order parametric dual is formulated. Weak, strong and converse duality theorems are established in order to relate the primal and dual problems under the afore-said assumptions.
| Original language | English |
|---|---|
| Pages (from-to) | 135-142 |
| Number of pages | 8 |
| Journal | Filomat |
| Volume | 27 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2013 |
Keywords
- Fractional minimax programming
- Generalized convexity
- Non-differentiable programming
- Optimal solutions
- Second order duality
ASJC Scopus subject areas
- General Mathematics
Fingerprint
Dive into the research topics of 'Second order nondifferentiable minimax fractional programming with square root terms'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver