Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
type: Item
instance of: scholarly article
title: Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
zbMATH Open document ID: 1403.90606
published in: European Journal of Operational Research
publication date: 2018-05-31T00:00:00Z
full work available at URL: http://hdl.handle.net/10045/75950
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 6877267
zbMATH Keywords: robustness and sensitivity analysis
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: convex optimization
zbMATH Keywords: robust optimization
zbMATH Keywords: robust efficient solutions
author: Miguel Angel Goberna
author: V. Jeyakumar
author: G. Li
author: José Vicente-Pérez
describes a project that uses: BENSOLVE
MaRDI profile type: Publication
OpenAlex ID: W2793406148
cites work: Stability in Mathematical Programming with Nondifferentiable Data
cites work: Q3182207
cites work: Robust solutions of uncertain linear programs
cites work: Linear Multiple Objective Problems with Interval Coefficients
cites work: Duality in Vector Optimization
cites work: Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
cites work: Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases
cites work: An exact formula for radius of robust feasibility of uncertain linear programs
cites work: Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
cites work: Minmax robustness for multi-objective optimization problems
cites work: Robust aspects of solutions in deterministic multiple objective linear programming
cites work: From scalar to vector optimization.
cites work: Constraint qualifications in convex vector semi-infinite optimization
cites work: Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
cites work: Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
cites work: Robust solutions to multi-objective linear programs with uncertain data
cites work: Q2753173
cites work: Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
cites work: The relationship between multi-objective robustness concepts and set-valued optimization
cites work: Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
cites work: Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
cites work: Bi-objective robust optimisation
cites work: On robust multiobjective optimization
cites work: Q5498974
cites work: Q5745068
cites work: Vector Optimization with Infimum and Supremum
cites work: Multiple objective linear programming models with interval coefficients -- an illustrated overview
cites work: Robustness in nonsmooth nonlinear multi-objective programming
DOI: 10.1016/J.EJOR.2018.03.018
Wikidata QID: Q130107416
description: scientific article; zbMATH DE number 6877267