Add to ORKGWe consider scalarization issues for vector problems in the case where the preference relation is represented by a rather arbitrary set. An algorithm for weights choice for a priori unknown preference relations is suggested. Some examples of applications to vector optimization, game equilibrium, and variational inequalities are described. © Allerton Press, Inc., 2012
<span lang="EN-US">We study vector optimization problems in partially ordered Banach Spaces. We sup...
An overview of the application of the previous theoretical results to game theory is presented.Final...
A new parameterized binary relation is used to define minimality concepts in vector optimization. To...
We consider scalarization issues for vector problems in the case where the preference relation is re...
We consider problems of vector optimization with preferences that are not necessarily a pre-order re...
In this paper we consider certain optimization problems which are described by inequalities in parti...
This book is devoted to vector or multiple criteria approaches in optimization. Topics covered inclu...
We consider an approach to convert vector variational inequalities into an equivalent scalar variati...
In this work, necessary and sufficient conditions for approximate solutions of vector optimization p...
A class of scalarizations of vector optimization problems is studied in order to characterize weakl...
AbstractThe scalarization approaches of Giannessi, Mastroeni and Pellegrini are extended to the stud...
In this paper, a method for scalarizing optimization problems whose final space is endowed with a bi...
This work focuses on scalarization processes for nonconvex set-valued optimization problems whose so...
Abstract. In this work we characterize different types of solutions of a vector optimization problem...
This chapter provides a brief survey on different kinds of set order relations which are used to com...
<span lang="EN-US">We study vector optimization problems in partially ordered Banach Spaces. We sup...
An overview of the application of the previous theoretical results to game theory is presented.Final...
A new parameterized binary relation is used to define minimality concepts in vector optimization. To...
We consider scalarization issues for vector problems in the case where the preference relation is re...
We consider problems of vector optimization with preferences that are not necessarily a pre-order re...
In this paper we consider certain optimization problems which are described by inequalities in parti...
This book is devoted to vector or multiple criteria approaches in optimization. Topics covered inclu...
We consider an approach to convert vector variational inequalities into an equivalent scalar variati...
In this work, necessary and sufficient conditions for approximate solutions of vector optimization p...
A class of scalarizations of vector optimization problems is studied in order to characterize weakl...
AbstractThe scalarization approaches of Giannessi, Mastroeni and Pellegrini are extended to the stud...
In this paper, a method for scalarizing optimization problems whose final space is endowed with a bi...
This work focuses on scalarization processes for nonconvex set-valued optimization problems whose so...
Abstract. In this work we characterize different types of solutions of a vector optimization problem...
This chapter provides a brief survey on different kinds of set order relations which are used to com...
<span lang="EN-US">We study vector optimization problems in partially ordered Banach Spaces. We sup...
An overview of the application of the previous theoretical results to game theory is presented.Final...
A new parameterized binary relation is used to define minimality concepts in vector optimization. To...