Optimality and Duality for Multiobjective Fractional Programming Involvingn-Set Functions
โ Scribed by Do Sang Kim; Cheong Lai Jo; Gue Myung Lee
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 160 KB
- Volume
- 224
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
โฆ Synopsis
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 relations for our ลฝ . problem MFP under convexity assumptions on objective and constrained functions.
๐ SIMILAR VOLUMES
A minmax programming problem involving several B-vex n-set functions is considered. Necessary and sufficient optimality theorems and Wolfe type duality ลฝ . results are established. Duality for the n-set generalized minmax fractional programming problem is derived as a special case of the main proble
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.
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