Robust approximate optimality conditions for uncertain vector optimization problems and applications
From MaRDI portal
Cites work
- A duality theorem for non-linear programming
- Approximate optimality conditions for robust convex optimization without convexity of constraints
- Characterizations of robust -quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Characterizations of robust solution set of convex programs with uncertain data
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- Characterizing robust solution sets of convex programs under data uncertainty
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- Convex Analysis
- Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry
- Convexificators for nonconvex multiobjective optimization problems with uncertain data: robust optimality and duality
- Duality in robust optimization: Primal worst equals dual best
- First order optimality conditions in vector optimization involving stable functions
- Functional analysis, calculus of variations and optimal control
- scientific article; zbMATH DE number 3856842 (Why is no real title available?)
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- Necessary efficiency conditions for vector equilibrium problems with general inequality constraints via convexificators
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- On robust multiobjective optimization
- Optimality and duality for approximate solutions of multiobjective optimization problems involving intersection of closed sets
- Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints
- Optimality and duality for robust multiobjective optimization problems
- Optimality and duality for robust optimization problems involving intersection of closed sets
- Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
- Optimality conditions and duality for nonsmooth vector equilibrium problems with constraints
- Optimality conditions for convex problems on intersections of non necessarily convex sets
- Optimization and nonsmooth analysis
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
- Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data
- Robust optimization
- Set-valued analysis
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Strong duality in robust convex programming: complete characterizations
- Theory and applications of robust optimization
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- Variational analysis and applications
- Wolfe duality for interval-valued optimization
This page was built for publication: Robust approximate optimality conditions for uncertain vector optimization problems and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7348546)
