In this paper we extend a (scalarized) generalized type-I invexity into a vector invexity (V-type I). A number of sufficiency results are established using Lagrange multiplier conditions and under various types of generalized V-type I requirements. Weak, strong, and converse duality theorems are pro
✦ LIBER ✦
On nondifferentiable minimax fractional programming under generalizedα-type I invexity
✍ Scribed by S. K. Mishra; J. S. Rautela
- Publisher
- Springer-Verlag
- Year
- 2008
- Tongue
- English
- Weight
- 369 KB
- Volume
- 31
- Category
- Article
- ISSN
- 1598-5865
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Multiobjective Programming under General
✍
Morgan A. Hanson; Rita Pini; Chanchal Singh
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 115 KB
Complex minimax programming under genera
✍
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. @
Optimality Conditions and Duality in Non
✍
I. Ahmad; Z. Husain
📂
Article
📅
2006
🏛
Springer
🌐
English
⚖ 220 KB
Second-Order Duality for Nondifferentiab
✍
S. K. Mishra; N. G. Rueda
📂
Article
📅
2006
🏛
Springer
🌐
English
⚖ 146 KB
Higher-Order Duality in Nondifferentiabl
✍
I. Ahmad; Z. Husain; S. Sharma
📂
Article
📅
2008
🏛
Springer
🌐
English
⚖ 297 KB
Minimax Fractional Programming forn-Set
✍
H. C. Lai; T. Y. Huang
📂
Article
📅
2008
🏛
Springer
🌐
English
⚖ 459 KB