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
Optimality and Duality for Complex Nondifferentiable Fractional Programming
โ Scribed by Jen-Chwan Liu; Chin-Cheng Lin; Ruey-Lin Sheu
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 276 KB
- Volume
- 210
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
โฆ Synopsis
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 parametric and two other parameter-free dual models with appropriate duality theorems.
๐ SIMILAR VOLUMES
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.
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
In this paper, necessary and sufficient optimality conditions are obtained for fractional programming problems involving arcwise connected, P-connected, and Qconnected functions. Duality results have also been established.