Generalized fractional minimax programming with -invexity
β Scribed by Tadeusz Antczak
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 496 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
Optimality conditions are proved for a class of generalized fractional minimax programming problems involving B-(p, r)-invexity functions. Subsequently, these optimality conditions are utilized as a basis for constructing various duality models for this type of fractional programming problems and proving appropriate duality theorems.
π SIMILAR VOLUMES
In this paper, we study a non-differentiable minimax fractional programming problem under the assumption of generalized -univex function. In this paper we extend the concept of -invexity [M.A. Noor, On generalized preinvex functions and monotonicities, J. Inequalities Pure Appl. Math. 5 (2004) 1-9]
Under different forms of invexity conditions, sufficient KuhnαTucker conditions and three dual models are presented for the minimax fractional programming.
In this paper, we consider a class of nonsmooth multiobjective fractional programming problems in which functions are locally Lipschitz. We establish generalized Karush-Kuhn-Tucker necessary and sufficient optimality conditions and derive duality theorems for nonsmooth multiobjective fractional prog