𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with -invex functions

✍ Scribed by Tadeusz Antczak


Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
257 KB
Volume
54
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

✦ Synopsis


In this paper, the so-called η-approximation approach is used to characterize solvability (in Pareto sense) of a nonlinear multiobjective programming problem with G-invex functions with respect to the same function η. In this method, an equivalent η-approximated vector optimization problem is constructed by a modification of both the objective and the constraint functions in the original multiobjective programming problem at the given feasible point. Moreover, in order to find a (weak) Pareto optimal solution in the original multiobjective problem, it is sufficient to solve its associated η-approximated vector optimization problem equivalent to the original multiobjective programming problem in the sense discussed in this paper.


📜 SIMILAR VOLUMES


Characterization of vector strict global
✍ Tadeusz Antczak 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Differentiable (F , ρ)-convex function of order 2 F -approximated vector optimization problem a b s t r a c t In this paper, a new approximation method is introduced to characterize a so-called vector strict global minimizer of order 2 for a class of nonlinear differentiable multiobjective programm