On sequential optimality conditions for robust multiobjective convex optimization problems

MaRDI QIDQ2787024zbMATH OpenFDO

Authors Jae Hyoung Lee, Gue Myung Lee

Publication date 24 February 2016

Published in Linear and Nonlinear Analysis (Search for Journal in Brave)

Full work available at URL http://www.yokohamapublishers.jp/online2/oplna/vol1/p221.html

zbMATH Keywords

properly robust efficient solutionrobust efficient solutionrobust multiobjective convex optimization problemssequential optimality conditionssubdifferentialsweakly robust efficient solution

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Review text

The authors establish necessary and sufficient conditions for robust efficient solutions, weakly and properly robust efficient solutions of robust multiobjective convex optimization problems without constraint qualification. They are sequential optimality conditions, which are expressed in terms of conjugate functions, subdifferentials and \(\epsilon\)-subdifferentials of convex functions. The relationships between robust efficient solutions and properly robust efficient solutions are also given.

Recommendations

• Optimality conditions of robust convex multiobjective optimization via -constraint scalarization and image space analysis
• On robust convex multiobjective optimization
• Necessary Optimality Conditions for Robust Nonsmooth Multiobjective Optimization Problems
• Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
• Optimality and duality for robust multiobjective optimization problems

Cited in

(8)

• Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
• On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
• Sufficient optimality conditions for a kind of robust efficient solutions in multiobjective optimization
• Optimality conditions of robust convex multiobjective optimization via -constraint scalarization and image space analysis
• On robust convex multiobjective optimization
• Sufficient Optimality Conditions for a Robust Multiobjective Problem
• On approximate optimality conditions for robust multi-objective convex optimization problems
• Karush-Kuhn-Tucker conditions and duality for a class of convex adjustable robust optimization problem

This page was built for publication: On sequential optimality conditions for robust multiobjective convex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2787024)