Characterizations of robust duality for a class of uncertain optimization problems
From MaRDI portal
Recommendations
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Characterizations of robust and stable duality for linearly perturbed uncertain optimization problems
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Characterizations of robust solution for convex optimization problems with data uncertainty
- Mond-Weir type approximate duality for a class of robust convex optimization
Cited in
(9)- An uncertain minimization problem: robust optimization versus optimization of robustness
- Characterizations of robust and stable duality for linearly perturbed uncertain optimization problems
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Mond-Weir type approximate duality for a class of robust convex optimization
- Robust duality for robust efficient solutions in uncertain vector optimization problems
- Robust duality for the uncertain multitime control optimization problems
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Complete characterizations of robust strong duality for robust vector optimization problems
This page was built for publication: Characterizations of robust duality for a class of uncertain optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3180624)
