✦ LIBER ✦

Complex minimax programming under generalized type-I functions

✍ Scribed by S.K. Mishra

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 557 KB
Volume: 50
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2005.04.002

No coin nor oath required. For personal study only.

✦ Synopsis

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. @

📜 SIMILAR VOLUMES

Minimax Fractional Programming forn-Set

Minimax Fractional Programming forn-Set Functions and Mixed-Type Duality under Generalized

✍ H. C. Lai; T. Y. Huang 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 459 KB

On nondifferentiable minimax fractional

On nondifferentiable minimax fractional programming under generalizedα-type I invexity

✍ S. K. Mishra; J. S. Rautela 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 369 KB

Second-Order Duality for Nondifferentiab

Second-Order Duality for Nondifferentiable Minimax Programming Involving Generalized Type I Functions

✍ S. K. Mishra; N. G. Rueda 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 146 KB

Higher-Order Duality in Nondifferentiabl

Higher-Order Duality in Nondifferentiable Minimax Programming with Generalized Type I Functions

✍ I. Ahmad; Z. Husain; S. Sharma 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 297 KB

Sufficiency and Duality in Multiobjectiv

Sufficiency and Duality in Multiobjective Programming under Generalized Type I Functions

✍ T. R. Gulati; I. Ahmad; D. Agarwal 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 342 KB

Multiobjective Programming under General

Multiobjective Programming under Generalized Type I Invexity

✍ Morgan A. Hanson; Rita Pini; Chanchal Singh 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 115 KB

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