Karush-Kuhn-Tucker conditions and duality for a class of convex adjustable robust optimization problem
From MaRDI portal
Publication:6552694
DOI10.1007/s40314-024-02762-yMaRDI QIDQ6552694
Mai Van Duy, Nguyen Minh Tung, Unnamed Author
Publication date: 10 June 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Robustness in mathematical programming (90C17)
Cites Work
- Unnamed Item
- Unnamed Item
- Robust duality for generalized convex programming problems under data uncertainty
- Adjustable robust counterpart of conic quadratic problems
- Selected topics in robust convex optimization
- Adjustable robust solutions of uncertain linear programs
- When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent?
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- Nonsmooth semi-infinite multiobjective optimization problems
- Recent advances in robust optimization: an overview
- On the approximability of adjustable robust convex optimization under uncertainty
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Adjustable robust optimization models for a nonlinear two-period system
- Robust profit opportunities in risky financial portfolios
- Robust solutions to multi-objective linear programs with uncertain data
- Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems
- Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Theory and Applications of Robust Optimization
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
- Convex Analysis
- Optimality and duality for robust multiobjective optimization problems
This page was built for publication: Karush-Kuhn-Tucker conditions and duality for a class of convex adjustable robust optimization problem