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

Generalized -univexity and duality for nondifferentiable minimax fractional programming

โœ Scribed by S.K. Mishra; R.P. Pant; J.S. Rautela

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
719 KB
Volume
70
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Non-differentiable minimax fractional pr
Non-differentiable minimax fractional programming with generalized -univexity
โœ Anurag Jayswal ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 197 KB

In this paper, we study a non-differentiable minimax fractional programming problem under the assumption of generalized -univex function. In this paper we extend the concept of -invexity [M.A. Noor, On generalized preinvex functions and monotonicities, J. Inequalities Pure Appl. Math. 5 (2004) 1-9]

Optimality and Duality for Complex Nondi
Optimality and Duality for Complex Nondifferentiable Fractional Programming
โœ 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

On necessary conditions for a class of n
On necessary conditions for a class of nondifferentiable minimax fractional programming
โœ H.Z. Luo; H.X. Wu ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 181 KB

The Kuhn-Tucker-type necessary optimality conditions are given for the problem of minimizing a max fractional function, where the numerator of the function involved is the sum of a differentiable function and a convex function while the denominator is the difference of a differentiable function and