𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sufficiency and Duality in Multiobjective Programming Involving Generalized (F, ρ)-Convexity

✍ Scribed by Brahim Aghezzaf; Mohamed Hachimi

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
96 KB
Volume
258
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

✦ Synopsis

New classes of generalized F, -convexity are introduced for vector-valued Ž . functions. Examples are given to show their relations with F, -pseudoconvex, Ž . Ž . F, -quasiconvex, and strictly F, -pseudoconvex vector-valued functions. The sufficient optimality conditions and duality results are obtained for multiobjective Ž . programming involving generalized F, -convex vector-valued functions. ᮊ 2001

📜 SIMILAR VOLUMES

On Efficiency and Duality for Multiobjec
On Efficiency and Duality for Multiobjective Variational Control Problems with (F − ρ)-Convexity
✍ C. Nahak; S. Nanda 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 222 KB

The concept of efficiency pareto optimum is used to formulate duality for multiobjective variational control problems. Wolfe and Mond᎐Weir type duals are Ž . formulated. Under the generalized F y -convexity on the functions involved, weak and strong duality theorems are proved.

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