Pareto robust optimization on Euclidean vector spaces
From MaRDI portal
Publication:2693797
Recommendations
- Pareto optimization in topological vector spaces
- Pareto efficiency in robust optimization
- Approximating the Pareto set of multiobjective linear programs via robust optimization
- Robust optimization revisited via robust vector Farkas lemmas
- Robustness in deterministic vector optimization
- Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces
- Robust counterparts and robust efficient solutions in vector optimization under uncertainty
- On the generic uniqueness of Pareto-efficient solutions of vector optimization problems
- Pareto-optimality conditions in discrete vector optimization problems
- On the existence of Pareto solutions for polynomial vector optimization problems
Cites work
- A Selection Problem of Shared Fixed Costs and Network Flows
- Are stable instances easy?
- Deriving robust counterparts of nonlinear uncertain inequalities
- Fairness and efficiency in multiportfolio optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Multiobjective optimization. Interactive and evolutionary approaches
- On general minimax theorems
- On minimizing the largest eigenvalue of a symmetric matrix
- On the power of unique 2-prover 1-round games
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Reducibility among combinatorial problems
- Robust Solutions to Uncertain Semidefinite Programs
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Robust convex optimization
- Robust global optimization with polynomials
- The impact of the existence of multiple adjustable robust solutions
Cited in
(2)
This page was built for publication: Pareto robust optimization on Euclidean vector spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693797)
