The aim of this paper is to investigate several inherited properties of convexity for set-valued maps and develop computational procedure based on such inherited properties. In this paper, we introduced two types of characteristic functions by using Tchebyshev scalarization, and defined four types of scalarization functions to characterize the images of set-valued maps.

In this paper, without assumption of monotonicity, we study the compactness and the connectedness of the weakly efficient solutions set to vector equilibrium problems by using scalarization method in locally convex spaces. Our results improve the corresponding results in [X. H. Gong, Connectedness of the solution sets and scalarization for vector equilibrium problems, J. Optim. Theory Appl. 133...

Efficient points are obtained for cone-ordered maximizations in n R using the method of scalarization. Various scalarizations are presented for ordering cones in general and then for the important special case of polyhedral cones. For polyhedral cones, it is shown how to find vectors in the positive dual cone that are needed for a scalarized objective function. Instructive examples are presented.

The purpose of this paper is to consider the set-valued optimization problem in Asplund spaces without convexity assumption. By a scalarization function introduced by Tammer and Weidner (J Optim Theory Appl 67:297–320, 1990), we obtain the Lagrangian condition for approximate solutions on set-valued optimization problems in terms of the Mordukhovich coderivative.

We study the linear instability and nonlinear dynamical evolution of Reissner-Nordstr\"om (RN) black hole in Einstein-Maxwell-scalar theory asymptotic flat spacetime. focus on coupling function $f(\phi)=e^{-b\phi^2}$ which allows both scalar-free RN solution scalarized solution. first present system parameters during dynamic scalarization. For parameter regions where spontaneous scalarization o...

In this paper, by virtue of a nonlinear scalarization function, two nonlinear weak separation functions, a nonlinear regular weak separation function, and a nonlinear strong separation function are first introduced, respectively. Then, by the image space analysis, a global saddle-point condition for a nonlinear function is investigated. It is shown that the existence of a saddle point is equiva...

This paper presents a new method for scalarization of nonlinear multi-objective optimization problems. We introduce a special class of monotonically increasing sublinear scalarizing functions and show that the scalar optimization problem constructed by using these functions, enables to compute complete set of weakly efficient, efficient, and properly efficient solutions of multi-objective optim...

In this paper we extend to the vector case the notion of increasing along rays function. The proposed definition is given by means of a nonlinear scalarization through the so-called oriented distance function from a point to a set. We prove that the considered class of functions enjoys properties similar to those holding in the scalar case, with regard to optimization problems, relations with (...

where C ⊆ Rm is a closed convex and pointed cone with nonempty interior intC. (WVVI) was firstly introduced by Giannessi []. It has been shown to have many applications in vector optimization problems and traffic equilibrium problems (e.g., [, ]). Error bounds are to depict the distance from a feasible solution to the solution set, and have played an important role not only in sensitivity an...