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

Complex Minimax Fractional Programming of Analytic Functions

โœ Scribed by H. C. Lai; J. C. Liu; S. Schaible

Publisher
Springer
Year
2007
Tongue
English
Weight
347 KB
Volume
137
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Complex minimax programming under genera
Complex minimax programming under generalized type-I functions
โœ S.K. Mishra ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 557 KB

We establish the Kuhn-Tucker type sufficient optlmahty conditions for complex mln-1max programming under generalized Type-I and related functions Subsequently, we apply these optimahty criteria to formulate two dual models We also establish weak, strong, and strict converse duality theorems. @

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