✦ LIBER ✦

Optimality criteria in mathematical programming involving generalized invexity

✍ Scribed by Norma G Rueda; Morgan A Hanson

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 441 KB
Volume: 130
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(88)90313-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimality criteria in nonlinear program

Optimality criteria in nonlinear programming involving nonconvex functions

✍ R.N Kaul; Surjeet Kaur 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 375 KB

Higher-Order Generalized Invexity and Du

Higher-Order Generalized Invexity and Duality in Mathematical Programming

✍ Shashi K. Mishra; Norma G. Rueda 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 124 KB

In this paper, we introduce the concepts of higher-order type-I, pseudo-type-I, and quasi-type-I functions and establish various higher-order duality results involving these functions.

Some Results on Mathematical Programming

Some Results on Mathematical Programming with Generalized Ratio Invexity

✍ L.Venkateswara Reddy; R.N. Mukherjee 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 855 KB

In this paper, a generalized ratio invexity concept has been applied for single objective fractional programming problems. A concept which has been invoked seems to be more general than the one used earlier by Khan and Hanson in such contexts. Further, duality results for fractional programs have al

Optimality and Duality for Nonsmooth Mul

Optimality and Duality for Nonsmooth Multiobjective Fractional Programming with Generalized Invexity

✍ 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

On Ratio Invexity in Mathematical Progra

On Ratio Invexity in Mathematical Programming

✍ Zulfiqar A. Khan; Morgan A. Hanson 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 111 KB

The nonlinear fractional programming problem is considered. The functions involved in the objective function and constraints are assumed to be invex and differentiable. It is shown that the ratio of invex functions is invex. Sufficient optimality and duality theorems are presented for an invex fract

On Incomplete Lagrange Function and Sadd

On Incomplete Lagrange Function and Saddle Point Optimality Criteria in Mathematical Programming

✍ C.R Bector; Suresh Chandra; Abha 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 89 KB