On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
From MaRDI portal
Publication:1730467
DOI10.1007/s10479-016-2363-5zbMath1446.90143OpenAlexW2546664489MaRDI QIDQ1730467
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2363-5
optimality conditionsmultiobjective optimizationsemi-infinite programmingrobust optimizationduality resultsweakly robust efficient solution
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (29)
Robust efficiency and well-posedness in uncertain vector optimization problems ⋮ Well-posedness for the optimistic counterpart of uncertain vector optimization problems ⋮ Optimality and duality in nonsmooth composite vector optimization and applications ⋮ Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data ⋮ Robustness in nonsmooth nonconvex optimization problems ⋮ Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces ⋮ Robust strong duality for nonconvex optimization problem under data uncertainty in constraint ⋮ 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 ⋮ Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems ⋮ Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints ⋮ On mathematical programs with equilibrium constraints under data uncertainty ⋮ Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data ⋮ Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data ⋮ On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty ⋮ Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints ⋮ Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems ⋮ Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty ⋮ Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications ⋮ Robust second order cone conditions and duality for multiobjective problems under uncertainty data ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials ⋮ Optimality conditions of robust convex multiobjective optimization viaε-constraint scalarization and image space analysis ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On \(\epsilon\)-solutions for robust semi-infinite optimization problems ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization ⋮ Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
Cites Work
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Robust linear semi-infinite programming duality under uncertainty
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust duality for generalized convex programming problems under data uncertainty
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Selected topics in robust convex optimization
- Duality in robust optimization: Primal worst equals dual best
- Robust solutions of uncertain linear programs
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- Robust optimization-methodology and applications
- Nonsmooth semi-infinite multiobjective optimization problems
- Constraint qualifications in linear vector semi-infinite optimization
- Characterizing robust solution sets of convex programs under data uncertainty
- Surrogate duality for robust optimization
- On robust multiobjective optimization
- Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Mathematical methods of game and economic theory
- Strong duality in robust semi-definite linear programming under data uncertainty
- Optimality and duality for robust multiobjective optimization problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
