𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized Pseudoconvex Functions and Multiobjective Programming

✍ Scribed by R.N. Mukherjee

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
164 KB
Volume
208
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

✦ Synopsis

In a recent work, cited in the Introduction, a concept of generalized pseudoconvexity was used to obtain optimality results in nonlinear programming. In the present work we give sufficient optimality conditions, in the context of the multiobjective programming problem under the assumptions of generalized pseudoconvexity on objective and constraint functions. An application of such a result is given for fractional programming also.

πŸ“œ SIMILAR VOLUMES

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

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 Conditions for Multiobjective
Optimality Conditions for Multiobjective Programming with Generalized (I, Ο, ΞΈ)-Convex Set Functions
✍ H.C Lai; J.C Liu πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 254 KB

In this paper, we establish some sufficient conditions under which a feasible solution of such a problem will be Pareto optimal provided that a weaker convexity requirement is satisfied; for Ε½ . instance α‘£, , -convexity is assumed for both objective and constraint set functions. Some duality models