Abstract
In the present paper, we move forward in the study of minimax fractional programming problem and establish sufficient optimality conditions under the assumptions of generalized (Hp, r)-invexity. Weak, strong and strict converse duality theorems are also derived for two types of dual models related to minimax fractional programming problem involving aforesaid invex functions. In order to show the existence of introduced class of functions, examples are given.
| Original language | English |
|---|---|
| Pages (from-to) | 1001-1018 |
| Number of pages | 18 |
| Journal | Journal of Industrial and Management Optimization |
| Volume | 10 |
| Issue number | 4 |
| DOIs | |
| State | Published - Oct 2014 |
Keywords
- (H, r)-invexity
- Duality
- Minimax fractional programming
- Sufficiency
ASJC Scopus subject areas
- Business and International Management
- Strategy and Management
- Control and Optimization
- Applied Mathematics
Fingerprint
Dive into the research topics of 'On minimax fractional programming problems involving generalized (Hp, r)-Invex functions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver