On sufficiency and duality for nonsmooth multiobjective programming problems involving generalized -invex functions
โ Scribed by I. Ahmad; S.K. Gupta; Anurag Jayswal
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 246 KB
- Volume
- 74
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
Using a parametric approach, we establish necessary and sufficient conditions and derive duality theorems for a class of nonsmooth generalized minimax fractional programming problems containing pseudoinvex functions.
New classes of generalized F, -convexity are introduced for vector-valued ลฝ . functions. Examples are given to show their relations with F, -pseudoconvex, ลฝ . ลฝ . F, -quasiconvex, and strictly F, -pseudoconvex vector-valued functions. The sufficient optimality conditions and duality results are obta