Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
From MaRDI portal
Publication:1754722
DOI10.1016/j.ejor.2018.03.018zbMath1403.90606MaRDI QIDQ1754722
José Vicente-Pérez, Guoyin Li, Miguel Angel Goberna, Vaithilingam Jeyakumar
Publication date: 31 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/75950
multi-objective optimization; convex optimization; robust optimization; robustness and sensitivity analysis; robust efficient solutions
90C25: Convex programming
90C47: Minimax problems in mathematical programming
90C29: Multi-objective and goal programming
Related Items
Unnamed Item, Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty, Recent contributions to linear semi-infinite optimization: an update, The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems, The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments, Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality, Pareto solutions in multicriteria optimization under uncertainty, Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality, On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty, A radius of robust feasibility for uncertain farthest Voronoi cells, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minmax robustness for multi-objective optimization problems
- Robustness in nonsmooth nonlinear multi-objective programming
- Constraint qualifications in convex vector semi-infinite optimization
- Bi-objective robust optimisation
- Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
- Multiple objective linear programming models with interval coefficients -- an illustrated overview
- From scalar to vector optimization.
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Robust solutions of uncertain linear programs
- Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- The relationship between multi-objective robustness concepts and set-valued optimization
- Robust aspects of solutions in deterministic multiple objective linear programming
- An exact formula for radius of robust feasibility of uncertain linear programs
- On robust multiobjective optimization
- Robust solutions to multi-objective linear programs with uncertain data
- Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
- Vector Optimization with Infimum and Supremum
- Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases
- Duality in Vector Optimization
- Stability in Mathematical Programming with Nondifferentiable Data
- Linear Multiple Objective Problems with Interval Coefficients
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
