scientific article; zbMATH DE number 6400960

zbMath1334.90157MaRDI QIDQ5498974

Daishi Kuroiwa, Gue Myung Lee

Publication date: 11 February 2015

Full work available at URL: http://www.yokohamapublishers.jp/online2/opjnca/vol15/p1125.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

multiobjective optimizationconstraint qualificationrobust optimality

Mathematics Subject Classification ID

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

Related Items (17)

Optimality conditions in convex multiobjective SIP ⋮ Robustness in nonsmooth nonconvex optimization problems ⋮ Some characterizations of robust optimal solutions for uncertain fractional optimization and applications ⋮ Some characterizations of robust optimal solutions for uncertain convex optimization problems ⋮ Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems ⋮ A theorem of the alternative with an arbitrary number of inequalities and quadratic programming ⋮ Weighted robust optimality of convex optimization problems with data uncertainty ⋮ On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty ⋮ Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems ⋮ On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems ⋮ On approximate solutions and saddle point theorems for robust convex optimization ⋮ Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs ⋮ The relationship between multi-objective robustness concepts and set-valued optimization ⋮ Optimality and duality for robust multiobjective optimization problems ⋮ Unnamed Item ⋮ Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints

This page was built for publication: