On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty
From MaRDI portal
Publication:2687494
Recommendations
- Robust approximate optimality for a class of uncertain semi-infinite multi-objective optimization problems
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data
- Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
Cites work
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- An easy path to convex analysis and applications
- Bounded sets of KKT multipliers in vector optimization
- Bounded sets of Lagrange multipliers for vector optimization problems in infinite dimension
- Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems
- Constructing uncertainty sets for robust linear optimization
- Convex Analysis
- Degenerate Nonlinear Programming with a Quadratic Growth Condition
- Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 193993 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- Minmax robustness for multi-objective optimization problems
- On nonsmooth optimality theorems for robust optimization problems
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On robust convex multiobjective optimization
- On robust multiobjective optimization
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Optimization and nonsmooth analysis
- Robust duality for generalized convex programming problems under data uncertainty
- Robust linear semi-infinite programming duality under uncertainty
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust optimization
- Robust solutions to multi-objective linear programs with uncertain data
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Robustness in deterministic multi-objective linear programming with respect to the relative interior and angle deviation
- Robustness in nonsmooth nonlinear multi-objective programming
- Selected topics in robust convex optimization
- Strong duality in robust convex programming: complete characterizations
- Theory and applications of robust optimization
- Variational Analysis
Cited in
(6)- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- Improvement of Karush-Kuhn-Tucker conditions under uncertainties using robust decision making indexes
- Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems
- Robust solutions and the weak and strong Kuhn-Tucker conditions in uncertain multi-objective optimization
- Robust optimality conditions for semi-infinite equilibrium problems involving data uncertainty
- Robust optimality and duality relations for multiobjective semi-infinite equilibrium problems having vanishing constraints with uncertain data
This page was built for publication: On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2687494)
