Identifying effective scenarios in distributionally robust stochastic programs with total variation distance
From MaRDI portal
Publication:1717235
DOI10.1007/s10107-017-1224-6zbMath1410.90142OpenAlexW2790051854WikidataQ57500059 ScholiaQ57500059MaRDI QIDQ1717235
Güzin Bayraksan, Hamed Rahimian, Tito Homem-de-mello
Publication date: 7 February 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1224-6
Related Items
Projections onto the canonical simplex with additional linear inequalities ⋮ Scenario reduction for stochastic programs with conditional value-at-risk ⋮ Frameworks and results in distributionally robust optimization ⋮ Partition-based distributionally robust optimization via optimal transport with order cone constraints ⋮ Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics ⋮ Effective Scenarios in Multistage Distributionally Robust Optimization with a Focus on Total Variation Distance ⋮ On the safe side of stochastic programming: bounds and approximations ⋮ Dual SDDP for risk-averse multistage stochastic programs ⋮ Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective ⋮ A further step for efficient corrections of inconsistent probabilistic data sets ⋮ Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems ⋮ Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set ⋮ Bounds for Multistage Mixed-Integer Distributionally Robust Optimization ⋮ Non-anticipative risk-averse analysis with effective scenarios applied to long-term hydrothermal scheduling ⋮ Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems ⋮ Tutorial on risk neutral, distributionally robust and risk averse multistage stochastic programming ⋮ Distributionally Robust Stochastic Dual Dynamic Programming ⋮ A data-driven approach for a class of stochastic dynamic optimization problems ⋮ Controlling risk and demand ambiguity in newsvendor models ⋮ Distributionally robust optimization. A review on theory and applications ⋮ Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations ⋮ Distributionally robust resource planning under binomial demand intakes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models and algorithms for distributionally robust least squares problems
- Distributionally robust multi-item newsvendor problems with multimodal demand distributions
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- Uncertain convex programs: randomized solutions and confidence levels
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Likelihood robust optimization for data-driven problems
- A framework for optimization under ambiguity
- A distributionally robust perspective on uncertainty quantification and chance constrained programming
- On distributionally robust multiperiod stochastic optimization
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- Ambiguous chance constrained problems and robust optimization
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
- Coherent Measures of Risk
- Decomposition Algorithms for Risk-Averse Multistage Stochastic Programs with Application to Water Allocation under Uncertainty
- Distributionally Robust Convex Optimization
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- Scenario Min-Max Optimization and the Risk of Empirical Costs
- Ambiguous Risk Measures and Optimal Robust Portfolios
- Distributionally Robust Stochastic Programming
- Risk-Averse Two-Stage Stochastic Program with Distributional Ambiguity
- Effective Scenarios in Multistage Distributionally Robust Optimization with a Focus on Total Variation Distance
- Worst-Case-Expectation Approach to Optimization Under Uncertainty
- Overlapping Batches for the Assessment of Solution Quality in Stochastic Programs
- Optimization of Convex Risk Functions
- Ambiguity in portfolio selection
- Rectangular Sets of Probability Measures
This page was built for publication: Identifying effective scenarios in distributionally robust stochastic programs with total variation distance
