Abstract
The aim of the present paper is to study a nondifferentiable minimax fractional programming problem under the assumptions of α-univex and related functions. In this paper we introduce the concepts of α-univex, pseudo α-univex, strict pseudo α-univex and quasi α-univex functions respectively by unifying the notions of α-invex and univex functions. We derive Karush-Kuhn-Tucker-type sufficient optimality conditions and establish weak, strong and converse duality theorems for the problem and its three different dual problems. The results in this paper extend several known results in the literature.
Original language | English |
---|---|
Pages (from-to) | 144-158 |
Number of pages | 15 |
Journal | Nonlinear Analysis, Theory, Methods and Applications |
Volume | 70 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Jan 2009 |
Externally published | Yes |
Keywords
- Duality
- Generalized convexity
- Nondifferentiable minimax fractional programming problems
- Sufficient optimality conditions
- α-univexity
ASJC Scopus subject areas
- Analysis
- Applied Mathematics