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.
Optimality and Duality for Nonsmooth Multiobjective Fractional Programming with Generalized Invexity
โ Scribed by H. Kuk; G.M. Lee; T. Tanino
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 97 KB
- Volume
- 262
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
โฆ Synopsis
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 programming problems containing V -ฯ-invex functions.
๐ SIMILAR VOLUMES
We extend the concepts of B-type I and generalized B-type I functions to the continuous case and we use these concepts to establish sufficient optimality conditions and duality results for multiobjective variational programming problems.
We consider a multiobjective fractional programming problem MFP involving vector-valued objective n-set functions in which their numerators are different from each other, but their denominators are the same. By using the concept of proper efficiency, we establish optimality conditions and duality re
Both parametric and nonparametric necessary and sufficient optimality conditions are established for a class of complex nondifferentiable fractional programming problems containing generalized convex functions. Subsequently, these optimality criteria are utilized as a basis for constructing one para
defined another kind of invexity, corresponding generalized invexity, and discussed the duality for multiobjective control problems with such generalized invexity. In this paper, the duality results for multiobjective control problems with Mond and Smart's generalized invexity are discussed.