✦ LIBER ✦
Optimality Conditions for Multiobjective Programming with Generalized (I, ρ, θ)-Convex Set Functions
✍ Scribed by H.C Lai; J.C Liu
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 254 KB
- Volume
- 215
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
✦ Synopsis
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 are also discussed. Wolfe-type and Mond᎐Weir-type duality theorems are proved.