Classification of vector optimization problems with uncertain factors
From MaRDI portal
This paper is devoted to the problem of formalizing the vector minimax (maximin) value. Possible formalization methods are examined, and relationships between various definitions are found. The concept of the vector minimax is shown to depend on whether the problem is analyzed from the point of view of the maximizing or minimizing player. As a result, two types of vector minimax values are distinguished: from the point of view of the informed or uninfomed player.
Recommendations
- Robust efficiency and well-posedness in uncertain vector optimization problems
- On some optimization problems under uncertainty
- scientific article; zbMATH DE number 1664597
- Well-posedness for the optimistic counterpart of uncertain vector optimization problems
- Perturbed ordering cones for the analysis of vector optimization problems under uncertainty
- A class of uncertain variational inequality problems
- Application of the set-theoretic approach to accounting of uncertainties in the solution of vector optimization problems
- Robust counterparts and robust efficient solutions in vector optimization under uncertainty
- Computer Aided Systems Theory – EUROCAST 2005
- Vector optimization problems and approximated vector optimization problems
Cited in
(7)- Vector minimax from the viewpoints of the opponents
- Scalarization method in multicriteria games
- Method of convolution in multicriteria problems with uncertainty
- Equilibria and compromises in two-person zero-sum multicriteria games
- Multicriteria competitive games as models in operations research
- Mixed strategies in vector optimization and Germeier's convolution
- Applying the linear scalarization in multicriteria maximin problems
This page was built for publication: Classification of vector optimization problems with uncertain factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954729)
