Abstract
In the present paper, we establish sufficient optimality conditions for a minimax fractional programming problem under the assumptions of (Φ, ρ)-invexity. Weak, strong and strict converse duality theorems are also derived for a dual model of minimax fractional programming problem.
| Original language | English |
|---|---|
| Pages (from-to) | 183-200 |
| Number of pages | 18 |
| Journal | Mathematical Reports |
| Volume | 17 |
| Issue number | 2 |
| State | Published - 2015 |
Keywords
- (Φ,ρ)-invexity
- Duality
- Fractional programming
- Minimax programming
- Sufficiency
ASJC Scopus subject areas
- Analysis
- Algebra and Number Theory
- Geometry and Topology
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Sufficiency and duality in minimax fractional programming with generalized (Φ, ρ)-invexity'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver