Sufficient Optimality Conditions for a Robust Multiobjective Problem

DOI10.1142/s0217595922500270zbMath1528.90244OpenAlexW4288714198MaRDI QIDQ6053531

Mohamed Ohda, Nazih Abderrazzak Gadhi

Publication date: 19 October 2023

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595922500270

zbMATH Keywords

sufficient optimality conditionsefficient solutionrobust multiobjective optimizationupper convexificator

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Cites Work

• Unnamed Item
• Unnamed Item
• Necessary optimality conditions for nonsmooth semi-infinite programming problems
• Robust conjugate duality for convex optimization under uncertainty with application to data classification
• Robust duality for generalized convex programming problems under data uncertainty
• Convexifactors, generalized convexity, and optimality conditions
• Duality in robust optimization: Primal worst equals dual best
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
• Nonsmooth semi-infinite multiobjective optimization problems
• Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
• Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
• Strong Duality in Robust Convex Programming: Complete Characterizations
• Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
• Optimization and nonsmooth analysis
• Sufficient Conditions for Global Minima of Suitably Convex Functionals from Variational and Control Theory
• Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
• A note on the paper “Optimality conditions for nonsmooth interval-valued and multiobjective semi-infinite programming”
• ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
• Necessary Optimality Conditions for Robust Nonsmooth Multiobjective Optimization Problems
• Optimality and duality for robust multiobjective optimization problems
• Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data

This page was built for publication: Sufficient Optimality Conditions for a Robust Multiobjective Problem