Efficiency optimality conditions for convex adjustable robust multiobjective optimizations and applications
From MaRDI portal
Cites work
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization
- Adjustable robust multiobjective linear optimization: Pareto optimal solutions via conic programming
- Adjustable robust optimization models for a nonlinear two-period system
- Adjustable robust optimization via Fourier-Motzkin elimination
- Adjustable robust solutions of uncertain linear programs
- An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem
- An improved definition of proper efficiency for vector maximization with respect to cones
- Convex Analysis
- Convex analysis and global optimization
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
- Generalized Farkas lemma with adjustable variables and two-stage robust linear programs
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- Karush-Kuhn-Tucker conditions and duality for a class of convex adjustable robust optimization problem
- Minmax robustness for multi-objective optimization problems
- Multicriteria Optimization
- On nonsmooth optimality theorems for robust optimization problems
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On robust multiobjective optimization
- On the approximability of adjustable robust convex optimization under uncertainty
- On the performance of affine policies for two-stage adaptive optimization: a geometric perspective
- On the power and limitations of affine policies in two-stage adaptive optimization
- Optimality conditions in convex multiobjective SIP
- Optimality of affine policies in multistage robust optimization
- Proper efficiency and the theory of vector maximization
- Proper Efficient Points for Maximizations with Respect to Cones
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust optimization
- Robust optimization with simulated annealing
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Selected topics in robust convex optimization
- Supermodularity and affine policies in dynamic robust optimization
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent?
This page was built for publication: Efficiency optimality conditions for convex adjustable robust multiobjective optimizations and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6854566)