Optimality and solutions for conic robust multiobjective programs
From MaRDI portal
Cites work
- Adjustable robust multiobjective linear optimization: Pareto optimal solutions via conic programming
- An easy path to convex analysis and applications
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Decision uncertainty in multiobjective optimization
- Deriving robust counterparts of nonlinear uncertain inequalities
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Graph implementations for nonsmooth convex programs
- Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs
- Minmax robustness for multi-objective optimization problems
- Multicriteria Optimization
- On general minimax theorems
- On robust multiobjective optimization
- Pareto solutions in multicriteria optimization under uncertainty
- Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization
- Robust aspects of solutions in deterministic multiple objective linear programming
- Robust multi-objective optimization with SOS-convex polynomials over a polynomial matrix inequality
- Robust multiobjective optimization with application to Internet routing
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust optimization
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
- 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
- Semidefinite Optimization and Convex Algebraic Geometry
- Some geometric results in semidefinite programming
- Theory and applications of robust optimization
- Vector optimization and monotone operators via convex duality. Recent advances
This page was built for publication: Optimality and solutions for conic robust multiobjective programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892807)
