Adjustable robust multiobjective linear optimization: Pareto optimal solutions via conic programming
From MaRDI portal
Cites work
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- A survey of adjustable robust optimization
- Adjustable robust solutions of uncertain linear programs
- Advances and Trends in Optimization with Engineering Applications
- An easy path to convex analysis and applications
- Bi-objective robust optimisation
- Convex Analysis
- Duality in two-stage adaptive linear optimization: faster computation and stronger bounds
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Generalized Farkas lemma with adjustable variables and two-stage robust linear programs
- Graph implementations for nonsmooth convex programs
- Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs
- Minmax robustness for multi-objective optimization problems
- Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach
- Multicriteria Optimization
- Nonsmooth vector functions and continuous optimization
- On general minimax theorems
- On robust multiobjective optimization
- On the approximability of adjustable robust convex optimization under uncertainty
- Pareto solutions in multicriteria optimization under uncertainty
- Portfolio optimization under partial uncertainty and incomplete information: a probability multimeasure-based approach
- Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization
- Robust aspects of solutions in deterministic multiple objective linear programming
- Robust Combinatorial Optimization with Exponential Scenarios
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust optimization
- Robust optimization of uncertain multistage inventory systems with inexact data in decision rules
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
- Robust solutions of multiobjective linear semi-infinite programs under constraint 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
- The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments
- Theory and applications of robust optimization
- Uncertain linear programs: extended affinely adjustable robust counterparts
Cited in
(4)- Efficiency optimality conditions for convex adjustable robust multiobjective optimizations and applications
- Multicriteria adjustable robustness
- Optimality and solutions for conic robust multiobjective programs
- Duality characterizations for a class of two-stage adjustable robust multiobjective programming
This page was built for publication: Adjustable robust multiobjective linear optimization: Pareto optimal solutions via conic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7002530)
