Robust duality for robust efficient solutions in uncertain vector optimization problems

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15) Problems with incomplete information (optimization) (49N30)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Some characterizations of robust optimal solutions for uncertain convex optimization problems
Optimality and duality in vector optimization involving generalized type I functions over cones
Weak and strong subgradients of set-valued maps
Robust duality for generalized convex programming problems under data uncertainty
New second-order optimality conditions for a class of differentiable optimization problems
Duality in robust optimization: Primal worst equals dual best
Optimality conditions for set-valued optimization problems
On quasi \(\epsilon\)-solution for robust convex optimization problems
Robust optimization-methodology and applications
Nonsmooth semi-infinite multiobjective optimization problems
Characterizing robust solution sets of convex programs under data uncertainty
Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
Some characterizations of approximate solutions for robust semi-infinite optimization problems
Mixed Type Duality for Set-valued Optimization Problems via Higher-order Radial Epiderivatives
Strong Duality in Robust Convex Programming: Complete Characterizations
On Weak Subdifferentials, Directional Derivatives, and Radial Epiderivatives for Nonconvex Functions
A hahn-banach theorem in ordered linear spaces and its applications
Some notes on weak subdifferential
Some properties of second-order weak subdifferentials
Proximal Analysis and Approximate Subdifferentials
Convex Analysis
Optimality and duality for robust multiobjective optimization problems

This page was built for publication: Robust duality for robust efficient solutions in uncertain vector optimization problems