Abstract
A higher-order dual for a non-differentiable minimax fractional programming problem is formulated. Using the generalized higher-order η-convexity assumptions on the functions involved, weak, strong and strict converse duality theorems are established in order to relate the primal and dual problems. Results obtained in this paper naturally unify and extend some previously known results on non-differentiable minimax fractional programming in the literature.
| Original language | English |
|---|---|
| Article number | 306 |
| Journal | Journal of Inequalities and Applications |
| Volume | 2012 |
| DOIs | |
| State | Published - 2012 |
| Externally published | Yes |
Bibliographical note
Funding Information:The research of the author is supported by the Internal Project No. IN111015 of King Fahd University of Petroleum and Minerals, Dhahran-31261, Saudi Arabia.
Keywords
- Fractional programming
- Generalized higher-order convexity
- Higher-order duality
- Nondifferentiable programming
- Optimal solutions
ASJC Scopus subject areas
- Analysis
- Discrete Mathematics and Combinatorics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Higher-order duality in nondifferentiable minimax fractional programming involving generalized convexity'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver