Vector optimization problems with nonconvex preferences
This paper studies vector optimization problems where the order is defined by a cone, which is not necessarily convex. First, the authors study six types of variational inequalities. For example, let \(X\) and \(Y\) be two Banach spaces ordered by cones \(C\subset X\) and \(P\subset Y\), respectively. The cone \(C\) is convex, whereas \(P\) is not. Let \(T\) be a mapping from \(X\) to the set of bounded linear operators from \(X\) to \(Y\), \(L(X,Y)\). Then a {\textit{strong vector variational inequality problem}} is defined as finding \(x\in C\) such that and \((Tx,y-x)\geq_P 0\) for every \(y\in C\). A problem of vector optimization of functional \((Tx,x)\) subject to a system of linear inequalities is called either strong or mild depending on whether the constraints are formulated in term of the cone \(P\) or its complement, but with the opposite sign of the inequality. A series of theorems formulate various conditions for existence of solution, as well as necessary optimality conditions in terms of variational inequalities. In Conclusions, the authors state that the results of this work will help to develop algorithms for finding the whole sets of solutions to vector optimization problems with nonconvex ordering cones. This statement is not supported by a single example in the paper, though.
- Existence of solution for generalized multivalued vector variational inequalities without convexity
- On vector variational-like inequalities
- Characterizations of the set less order relation in nonconvex set optimization
- Vector \(F\)-complementarity problems with nonconvex preferences and applications to vector optimization problems
- On nondifferentiable and nonconvex vector optimization problems
- Abstract convexity and global optimization
- Complementarity, equilibrium, efficiency and economics
- Continuousization of the family of point-to-set maps and its applications
- Equivalence of Linear Complementarity Problems and Linear Programs in Vector Lattice Hilbert Spaces
- Equivalence of Nonlinear Complementarity Problems and Least Element Problems in Banach Lattices
- scientific article; zbMATH DE number 3761793 (Why is no real title available?)
- scientific article; zbMATH DE number 1568692 (Why is no real title available?)
- On the equivalence of extended generalized complementarity and generalized least-element problems
- Scalarization and nonlinear scalar duality for vector optimization with preferences that are not necessarily a pre-order relation
- Strong vector \(F\)-complementary problem and least element problem of feasible set
- Variational methods in partially ordered spaces
- Vector complementarity and minimal element problems
- Vector complementarity problems with a variable ordering relation
- Vector optimization. Set-valued and variational analysis.
- Extended mixed vector equilibrium problems
- Characterizations of the set less order relation in nonconvex set optimization
- Vector \(F\)-complementarity problems with nonconvex preferences and applications to vector optimization problems
- On approximate starshapedness in multiobjective optimization
- Optimization and nontransitive preference-relations
- Necessary conditions for εe-minimizers in vector optimization with empty interior ordering sets
- scientific article; zbMATH DE number 3944661 (Why is no real title available?)
- scientific article; zbMATH DE number 25466 (Why is no real title available?)
- Survey on vector complementarity problems
- A Vectorization Scheme for Nonconvex Set Optimization Problems
- Properties of strongly star shaped cones
- Lower semicontinuity for parametric weak vector variational inequalities in reflexive Banach spaces
- On nondifferentiable and nonconvex vector optimization problems
- Existence of solutions for \(\eta \)-generalized vector variational-like inequalities
- Vector equilibrium flows with nonconvex ordering relations
This page was built for publication: Vector optimization problems with nonconvex preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481362)