Well-posedness for the optimistic counterpart of uncertain vector optimization problems
From MaRDI portal
Recommendations
- Robust efficiency and well-posedness in uncertain vector optimization problems
- scientific article; zbMATH DE number 4049414
- The well-posedness of vector optimization problem
- Well-posedness and convexity in vector optimization
- scientific article; zbMATH DE number 862337
- Vector well-posedness of optimization problems and variational inequalities
- Well posedness in vector optimization problems and vector variational inequalities
- Well-posed vector optimization problems and vector variational inequalities
- scientific article; zbMATH DE number 5961787
- Extended well-posedness properties of vector optimization problems
Cites work
- scientific article; zbMATH DE number 1377943 (Why is no real title available?)
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Convexity and global well-posedness in set-optimization
- Discontinuous but Well‐Posed Optimization Problems
- Duality in robust optimization: Primal worst equals dual best
- Dynamic pricing and inventory control: robust vs. stochastic uncertainty models---a computational study
- Extended well-posedness of quasiconvex vector optimization problems
- Extended well-posedness of vector optimization problems: the convex case
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Generalized minimality in set optimization
- Generalized semicontinuity and existence theorems for cone saddle points
- Introduction to stochastic programming.
- Levitin-Polyak well-posedness for parametric quasivariational inequality problem of the Minty type
- Levitin-Polyak well-posedness for set optimization problems involving set order relations
- Minmax robustness for multi-objective optimization problems
- Multicriteria Optimization
- Nonconvex scalarization in set optimization with set-valued maps
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On the stability of the functional optimization problem
- Pointwise well-posedness and scalarization in set optimization
- Pointwise well-posedness in set optimization with cone proper sets
- Primal worst and dual best in robust vector optimization
- Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization
- Recent Developments in Vector Optimization
- Robust Mean-Covariance Solutions for Stochastic Optimization
- Robust multiobjective optimization with application to Internet routing
- Robust optimization
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- The relationship between multi-objective robustness concepts and set-valued optimization
- Tykhonov well-posedness for lexicographic equilibrium problems
- Tykhonov well-posedness for quasi-equilibrium problems
- Vector Optimization
- Well-posed equilibrium problems
- Well-posed optimization problems
- Well-posedness and scalarization in vector optimization
- Well-posedness for set optimization problems
- Well-posedness of a class of generalized mixed hemivariational-variational inequalities
- Well-setness and scalarization in set optimization
Cited in
(12)- Classification of vector optimization problems with uncertain factors
- Robust efficiency and well-posedness in uncertain vector optimization problems
- Levitin-Polyak well-posedness for vector optimization problems in linear spaces
- \(\chi\)-optimal solution of single objective nonlinear optimization problem with uncertain parameters
- Existence and well-posedness for excess demand equilibrium problems
- On global well-posedness of semi-infinite set optimization problems
- Connectedness of the solution sets in generalized semi-infinite set optimization
- On the convergence of efficient solutions to semi-infinite set-optimization problems
- Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency
- Hadamard well-posedness for a set optimization problem with an infinite number of constraints
- Global well-posedness of set-valued optimization with application to uncertain problems
- Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization
This page was built for publication: Well-posedness for the optimistic counterpart of uncertain vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828816)
