✦ LIBER ✦

Sufficiency criteria and duality for nonlinear programs involving n-set functions

✍ Scribed by G.J Zalmai

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 839 KB
Volume: 149
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(90)90045-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficiency and Duality for Nonlinear Mul

Efficiency and Duality for Nonlinear Multiobjective Programs Involving n-Set Functions

✍ C.R. Bector; D. Bhatia; S. Pandey 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Duality for generalized fractional progr

Duality for generalized fractional programs involving n-set functions

✍ G.J Zalmai 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Duality for Multiobjective Fractional Pr

Duality for Multiobjective Fractional Programming Involving n-Set Functions

✍ C.R. Bector; D. Bhatia; S. Pandey 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 580 KB

Sufficiency and Duality in Multiobjectiv

Sufficiency and Duality in Multiobjective Programming Involving Generalized F-Convex Functions

✍ T.R. Gulati; M.A. Islam 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 414 KB

Optimality and Duality for Multiobjectiv

Optimality and Duality for Multiobjective Fractional Programming Involvingn-Set Functions

✍ Do Sang Kim; Cheong Lai Jo; Gue Myung Lee 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 160 KB

We consider a multiobjective fractional programming problem MFP involving vector-valued objective n-set functions in which their numerators are different from each other, but their denominators are the same. By using the concept of proper efficiency, we establish optimality conditions and duality re

Optimality and Duality for Generalized F

Optimality and Duality for Generalized Fractional Programming Involving Nonsmooth Pseudoinvex Functions

✍ J.C. Liu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 193 KB

Using a parametric approach, we establish necessary and sufficient conditions and derive duality theorems for a class of nonsmooth generalized minimax fractional programming problems containing pseudoinvex functions.