𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multiobjective Programming with Semilocally Convex Functions

✍ Scribed by R.N. Mukherjee; S.K. Mishra

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
167 KB
Volume
199
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Generalized Pseudoconvex Functions and M
Generalized Pseudoconvex Functions and Multiobjective Programming
✍ R.N. Mukherjee πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 164 KB

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 genera

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