Optimization with Stochastic Preferences Based on a General Class of Scalarization Functions
From MaRDI portal
Publication:4969337
DOI10.1287/opre.2017.1671zbMath1473.90099OpenAlexW2744291685MaRDI QIDQ4969337
Publication date: 5 October 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5b7d8b112bb8cde07ade6b4028ccb8c94f3fc5b8
risk measuresstochastic dominancebenchmarkingcut generationstochastic multicriteria optimizationorder relations and utility
Related Items (11)
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ Distributionally Robust Second-Order Stochastic Dominance Constrained Optimization with Wasserstein Ball ⋮ Preference Robust Optimization for Choice Functions on the Space of CDFs ⋮ Vector-valued multivariate conditional value-at-risk ⋮ Conditional value‐at‐risk beyond finance: a survey ⋮ Distributionally robust optimization with multivariate second-order stochastic dominance constraints with applications in portfolio optimization ⋮ Data-driven stochastic programming with distributionally robust constraints under Wasserstein distance: asymptotic properties ⋮ Interval-based stochastic dominance: theoretical framework and application to portfolio choices ⋮ Multivariate robust second-order stochastic dominance and resulting risk-averse optimization ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ Two-stage stochastic programming under multivariate risk constraints with an application to humanitarian relief network design
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cut generation for optimization problems with multivariate risk constraints
- A numerical method for nonconvex multi-objective optimal control problems
- A new achievement scalarizing function based on parameterization in multiobjective optimization
- Solution approaches for the multiobjective stochastic programming
- Sample average approximation of stochastic dominance constrained programs
- Kusuoka representations of coherent risk measures in general probability spaces
- Optimization with multivariate stochastic dominance constraints
- Robust multicriteria risk-averse stochastic programming models
- A two-slope achievement scalarizing function for interactive multiobjective optimization
- On scalarizing functions in multiobjective optimization
- Generalized quantiles as risk measures
- Consistent risk measures for portfolio vectors
- Inverse stochastic dominance constraints and rank dependent expected utility theory
- Inverse portfolio problem with mean-deviation model
- Coherent Measures of Risk
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- Optimization with Multivariate Stochastic Dominance Constraints
- Robust and Stochastically Weighted Multiobjective Optimization Models and Reformulations
- A Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints
- Lectures on Stochastic Programming
- Optimization with Stochastic Dominance Constraints
- The Dual Theory of Choice under Risk
- Dual Stochastic Dominance and Related Mean-Risk Models
- Optimization with Multivariate Conditional Value-at-Risk Constraints
- On Kusuoka Representation of Law Invariant Risk Measures
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- Multicriteria Optimization
- Stochastic multi-objective optimization: a survey on non-scalarizing methods
This page was built for publication: Optimization with Stochastic Preferences Based on a General Class of Scalarization Functions