scientific article; zbMATH DE number 6541193
From MaRDI portal
Publication:5745068
zbMath1332.90240MaRDI QIDQ5745068
Publication date: 12 February 2016
Full work available at URL: http://www.yokohamapublishers.jp/online2/opjnca/vol16/p2039.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
generalized gradientsdata uncertaintylocally lipchitz functionsnonsmooth optimality theoremsrobust multiobjective optimization problem
Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (18)
Robustness in nonsmooth nonconvex optimization problems ⋮ Unnamed Item ⋮ Second-order cone programming relaxations for a class of multiobjective convex polynomial problems ⋮ Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems ⋮ On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization ⋮ Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints ⋮ Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints ⋮ Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications ⋮ Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty ⋮ Robust second order cone conditions and duality for multiobjective problems under uncertainty data ⋮ Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs ⋮ Robust alternative theorem for linear inequalities with applications to robust multiobjective 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 ⋮ Unnamed Item ⋮ On approximate solutions for nonsmooth robust multiobjective optimization problems ⋮ Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
This page was built for publication:
