Scalarization for pointwise well-posed vectorial problems

The aim of this paper is to develop a method of study of Tykhonov well-posedness notions for vector valued problems using a class of scalar problems. Having a vectorial problem, the scalarization technique we use allows us to construct a class of scalar problems whose well-posedness properties are equivalent with the most known well-posedness properties of the original problem. Then a well-posedness property of a quasiconvex level-closed problem is derived.      

On the choice of parameters for the weighting method in vector optimization

We present a geometrical interpretation of the weighting method for constrained (finite dimensional) vector optimization. This approach is based on rigid movements which separate the image set from the negative of the ordering cone. We study conditions on the existence of such translations in terms of the boundedness of the scalar problems produced by the weighting method. Finally, using recession cones, we obtain the main result of our work: a sufficient condition under which weighting vectors yield solvable scalar problems. An erratum to this article can be found at     

Generalized Symmetric Vector Quasiequilibrium Problems

We establish an existence result for scalar quasiequilibrium problems without any continuity requirement on noncompact subsets of locally convex topological vector spaces. As a consequence, we obtain a solution of symmetric scalar quasiequilibrium problem. Moreover, using a so-called nonlinear scalarization function, existence theorems for vector quasiequilibrium problems and general symmetric vector quasiequilibrium problems are obtained. The authors express their sincere gratitude to the referee for valuable comments and suggestions. This research was in part supported by a grant from IPM (No. 86470016) and the Center of Excellence for Mathematics, University of Isfahan.     

Image Space Analysis and Scalarization of Multivalued Optimization

Using a new method based on generalized sections of feasible sets, we obtain optimality conditions for vector optimization of objective multifunctions with multivalued constraints. The authors express their sincere gratitude to Professor F. Giannessi and the referees for comments and valuable suggestions. The second author was partially supported by the Center of Excellence for Mathematics (University of Isfahan).     

New Type of Generalized Vector Quasiequilibrium Problem

In this paper, we introduce a new type of vector quasiequilibrium problem with set-valued mappings and moving cones. By using the scalarization method and fixed-point theorem, we obtain its existence theorem. As applications, we derive some existence theorems for vector variational inequalities and vector complementarity problems. This work was supported by the National Natural Science Foundation of China. The authors are grateful to Professor X.Q. Yang and the referees for valuable comments and suggestions improving the original draft.     

A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures

This paper investigates some properties of approximate efficiency in variable ordering structures where the variable ordering structure is given by a special set valued map. We characterize $\epsilon$-minimal and $\epsilon$- nondominated elements as approximate solutions of a multiobjective optimization problem with a variable ordering structure and give necessary and sufficient conditions for these solutions, via scalarization.     

New Results on Henig Proper Generalized Vector Quasiequilibrium Problems

New sufficient conditions are given for the existence of solutions of a Henig proper generalized vector quasiequilibrium problem with moving cones. They are established by a new scalarizing approach, which is based on a suitable nonlinear scalarization function, proposed recently for set-valued maps in Sach and Tuan (J. Optim. Theory Appl. 157:347–364 (2013)). Examples are given to illustrate our main results.     

A set scalarization function based on the oriented distance and relations with other set scalarizations

ABSTRACT

The aim of this paper is, in the setting of normed spaces with a cone K non necessarily solid, to study new relations among set scalarization functions that are extensions of the oriented distance of Hiriart-Urruty. Moreover, we deal with a set scalarization function of sup-inf type, we investigate its relation to the cone-properness and cone-boundedness and it is related to other set scalarizations existing in the literature. In particular, with the norm induced by the Minkowski's functional, we obtain relations with a set scalarization which is an extension of the so called Gerstewitz's scalarization function.     

On subdifferential calculus for set-valued mappings and optimality conditions

The aim of this paper is to establish formulas for the subdifferentials of the sum and the composition of convex set-valued mappings under the Attouch–Brézis qualification condition. An application to a general set-valued optimization problem is considered.     

Optimality Conditions for Metrically Consistent Approximate Solutions in Vector Optimization

In this paper, approximate solutions of vector optimization problems are analyzed via a metrically consistent ε-efficient concept. Several properties of the ε-efficient set are studied. By scalarization, necessary and sufficient conditions for approximate solutions of convex and nonconvex vector optimization problems are provided; a characterization is obtained via generalized Chebyshev norms, attaining the same precision in the vector problem as in the scalarization. This research was partially supported by the Ministerio de Educación y Ciencia (Spain), Project MTM2006-02629 and by the Consejería de Educación de la Junta de Castilla y León (Spain), Project VA027B06. The authors are grateful to the anonymous referees for helpful comments and suggestions.