๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimality and Duality for Generalized Fractional Programming Involving Nonsmooth Pseudoinvex Functions

โœ Scribed by J.C. Liu


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
193 KB
Volume
202
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

โœฆ Synopsis


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.


๐Ÿ“œ SIMILAR VOLUMES


Optimality and Duality for Nonsmooth Mul
โœ H. Kuk; G.M. Lee; T. Tanino ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 97 KB

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

Optimality and Duality for Multiobjectiv
โœ Do Sang Kim; Cheong Lai Jo; Gue Myung Lee ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 160 KB

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 Conditions and Duality for Fr
โœ Sonia Davar; Aparna Mehra ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 126 KB

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.

Optimality and Duality for Complex Nondi
โœ Jen-Chwan Liu; Chin-Cheng Lin; Ruey-Lin Sheu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 276 KB

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