Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
From MaRDI portal
Publication:1754722
Recommendations
- Robust solutions to multi-objective linear programs with uncertain data
- On highly robust efficient solutions to uncertain multiobjective linear programs
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
- Robust optimization model for uncertain multiobjective linear programs
- Robust solutions of multiobjective linear semi-infinite programs under constraint data uncertainty
Cites work
- An exact formula for radius of robust feasibility of uncertain linear programs
- Bi-objective robust optimisation
- Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
- Constraint qualifications in convex vector semi-infinite optimization
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases
- Duality in Vector Optimization
- From scalar to vector optimization.
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 6541193 (Why is no real title available?)
- Linear Multiple Objective Problems with Interval Coefficients
- Minmax robustness for multi-objective optimization problems
- Multiple objective linear programming models with interval coefficients -- an illustrated overview
- On robust convex multiobjective optimization
- On robust multiobjective optimization
- Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Robust aspects of solutions in deterministic multiple objective linear programming
- Robust optimization
- Robust solutions of multiobjective linear semi-infinite programs under constraint data uncertainty
- Robust solutions of uncertain linear programs
- Robust solutions to multi-objective linear programs with uncertain data
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Robustness in nonsmooth nonlinear multi-objective programming
- Stability in Mathematical Programming with Nondifferentiable Data
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- The relationship between multi-objective robustness concepts and set-valued optimization
- Vector Optimization with Infimum and Supremum
Cited in
(21)- Recent contributions to linear semi-infinite optimization: an update
- On highly robust efficient solutions to uncertain multiobjective linear programs
- The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
- 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
- On highly robust approximate solutions for nonsmooth convex optimizations with data uncertainty
- Robust sufficient optimality conditions and duality in semi-infinite multiobjective programming with data uncertainty
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- On robust convex multiobjective optimization
- Robust second order cone conditions and duality for multiobjective problems under uncertainty data
- Local isolated efficiency in non-smooth robust semi-infinite multi-objective fractional programming problems
- Robust optimization model for uncertain multiobjective linear programs
- Optimality and solutions for conic robust multiobjective programs
- A new approach for the -quasi solution of nonsmooth semi-infinite optimization problems under data uncertainty
- Adjustable robust multiobjective linear optimization: Pareto optimal solutions via conic programming
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
This page was built for publication: Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754722)
