A class of scalarizations of vector optimization problems is studied in order to characterize weakly efficient, efficient, and properly efficient points of a nonconvex vector problem. A parallelism is established between the different solutions of the scalarized problem and the various efficient frontiers. In particular, properly efficient points correspond to stable solutions with respect to suitable perturbations of the feasible set
We consider problems of vector optimization with preferences that are not necessarily a pre-order re...
The aim of this work is to characterize the various sets of solutions of a vector optimization probl...
In this paper, we study vector optimization problems in partially ordered Banach spaces. We suppose...
A class of scalarizations of vector optimization problems is studied in order to characterize weakl...
A class of scalarizations of vector optimization problems is studied in order to characterize weakl...
A class of scalarizations of vector optimization problems is studied in order to characterize weakl...
A class of scalarizations of vector optimization problems is studied in order to characterize weakl...
A class of scalarizations of vector optimization problems is studied in order to characterize weakly...
Abstract. In this work we characterize different types of solutions of a vector optimization problem...
In this work we characterize different types of solutions of a vector optimization problem by means ...
In this work we characterize different types of solutions of a vector optimization problem by means ...
In this work, necessary and sufficient conditions for approximate solutions of vector optimization p...
The aim of this work is to characterize the various sets of solutions of a vector optimization probl...
In this paper we consider certain optimization problems which are described by inequalities in parti...
The aim of this work is to characterize the various sets of solutions of a vector optimization probl...
We consider problems of vector optimization with preferences that are not necessarily a pre-order re...
The aim of this work is to characterize the various sets of solutions of a vector optimization probl...
In this paper, we study vector optimization problems in partially ordered Banach spaces. We suppose...
A class of scalarizations of vector optimization problems is studied in order to characterize weakl...
A class of scalarizations of vector optimization problems is studied in order to characterize weakl...
A class of scalarizations of vector optimization problems is studied in order to characterize weakl...
A class of scalarizations of vector optimization problems is studied in order to characterize weakl...
A class of scalarizations of vector optimization problems is studied in order to characterize weakly...
Abstract. In this work we characterize different types of solutions of a vector optimization problem...
In this work we characterize different types of solutions of a vector optimization problem by means ...
In this work we characterize different types of solutions of a vector optimization problem by means ...
In this work, necessary and sufficient conditions for approximate solutions of vector optimization p...
The aim of this work is to characterize the various sets of solutions of a vector optimization probl...
In this paper we consider certain optimization problems which are described by inequalities in parti...
The aim of this work is to characterize the various sets of solutions of a vector optimization probl...
We consider problems of vector optimization with preferences that are not necessarily a pre-order re...
The aim of this work is to characterize the various sets of solutions of a vector optimization probl...
In this paper, we study vector optimization problems in partially ordered Banach spaces. We suppose...