On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty

DOI10.1007/s40314-023-02224-xzbMath1506.65080OpenAlexW4322496524MaRDI QIDQ2687494

Nguyen Minh Tung

Publication date: 2 March 2023

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-023-02224-x

zbMATH Keywords

optimality conditionrobust optimizationconstraint qualificationsemi-infinite optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minmax robustness for multi-objective optimization problems
• Robustness in nonsmooth nonlinear multi-objective programming
• Robust linear semi-infinite programming duality under uncertainty
• Robust duality for generalized convex programming problems under data uncertainty
• Bounded sets of Lagrange multipliers for vector optimization problems in infinite dimension
• Selected topics in robust convex optimization
• On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
• Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
• Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
• Bounded sets of KKT multipliers in vector optimization
• On robust multiobjective optimization
• Robust solutions to multi-objective linear programs with uncertain data
• Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems
• Robustness in deterministic multi-objective linear programming with respect to the relative interior and angle deviation
• Strong Duality in Robust Convex Programming: Complete Characterizations
• Constructing Uncertainty Sets for Robust Linear Optimization
• Theory and Applications of Robust Optimization
• Optimization and nonsmooth analysis
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• Variational Analysis
• Degenerate Nonlinear Programming with a Quadratic Growth Condition
• 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
• Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts

This page was built for publication: On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty