𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strict Efficiency in Vector Optimization

✍ Scribed by Bienvenido Jiménez

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
155 KB
Volume
265
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

✦ Synopsis

The notion of strict minimum of order m for real optimization problems is extended to vector optimization. Its properties and characterization are studied in Ž . the case of finite-dimensional spaces multiobjective problems . Also the notion of super-strict efficiency is introduced for multiobjective problems, and it is proved that, in the scalar case, all of them coincide. Necessary conditions for strict minimality and for super-strict minimality of order m are provided for multiobjective problems with an arbitrary feasible set. When the objective function is Frechet differentiable, necessary and sufficient conditions are established for the case m s 1, resulting in the situation that the strict efficiency and super-strict efficiency notions coincide.

📜 SIMILAR VOLUMES

Approximately Efficient Solutions in Vec
Approximately Efficient Solutions in Vector Optimization
✍ Tamaki Tanaka 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 596 KB

An approach to approximating solutions in vector optimization is developed for vector optimization problems with arbitrary ordering cones. This paper presents a study of approximately efficient points of a given set with respect to a convex cone in an ordered Banach space. Existence results for such

Some Remarks on Dualization in Vector Op
Some Remarks on Dualization in Vector Optimization
✍ Hirotaka Nakayama 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 457 KB 👁 1 views

In recent years there have been several reports on duality in vector optimization. However, there seems to be no unified approach to dualization. In a previous paper by the author a geometric consideration was given to duality in non-linear vector optimization. In this paper a relationship between d

Sensitivity Analysis in Parametrized Con
Sensitivity Analysis in Parametrized Convex Vector Optimization
✍ Hun Kuk; Tetsuzo Tanino; Masahiro Tanaka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 146 KB

This paper provides some results concerning sensitivity analysis in parametrized Ž convex vector optimization. We consider three types of perturbation maps i.e., . perturbation map, proper perturbation map, and weak perturbation map accord-Ž ing to three kinds of solution concepts i.e., minimality,

Conjugate Duality in Set-Valued Vector O
Conjugate Duality in Set-Valued Vector Optimization
✍ Wen Song 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 236 KB

In this paper, conjugate duality results for convexlike set-valued vector optimization problems are presented under closedness or boundedness hypotheses. Some properties of the value mapping of a set-valued vector optimization problem are studied. A conjugate duality result is also proved for a conv