Abstract
In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution to the problem and then establish weak, strong, and strict converse duality theorems for the problem and its dual problem under B-(p, r)-invexity assumptions. Examples are given to show that B-(p, r)-invex functions are generalization of (p, r)-invex and convex functions
| Original language | English |
|---|---|
| Article number | 75 |
| Journal | Journal of Inequalities and Applications |
| Volume | 2011 |
| DOIs | |
| State | Published - 2011 |
Keywords
- B-(p, r)-invex function
- Duality theorems
- Nondifferentiable fractional programming
- Optimality conditions
ASJC Scopus subject areas
- Analysis
- Discrete Mathematics and Combinatorics
- Applied Mathematics