On solution sets for robust optimization problems
From MaRDI portal
Recommendations
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- On solution sets for convex optimization problems
- Characterizations of robust solution set of convex programs with uncertain data
- Characterizations of robust -quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Characterizations of the solution set for a class of nonsmooth optimization problems
Cited in
(14)- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Characterizing the solution set of convex optimization problems without convexity of constraints
- Characterizations of the solution set for a class of nonsmooth optimization problems
- Radius of robust feasibility of system of convex inequalities with uncertain data
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Essential intersection and approximation results for robust optimization
- On the formulation and solution of robust performance problems
- On solution sets for convex optimization problems
- Soft robust solutions to possibilistic optimization problems
- scientific article; zbMATH DE number 4200064 (Why is no real title available?)
- Convexificators for nonconvex multiobjective optimization problems with uncertain data: robust optimality and duality
- scientific article; zbMATH DE number 6843801 (Why is no real title available?)
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Complexity and in-approximability of a selection problem in robust optimization
This page was built for publication: On solution sets for robust optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999194)
