𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized Convexity in Multiobjective Programming

✍ Scribed by R. Osuna-Gómez; A. Beato-Moreno; A. Rufian-Lizana

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
108 KB
Volume
233
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sufficiency and Duality in Multiobjectiv
Sufficiency and Duality in Multiobjective Programming Involving Generalized (F, ρ)-Convexity
✍ Brahim Aghezzaf; Mohamed Hachimi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 96 KB

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 obta

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

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