Applying the minimax criterion in stochastic recourse programs
From MaRDI portal
Publication:1771344
DOI10.1016/j.ejor.2003.09.033zbMath1062.90043OpenAlexW1978787448MaRDI QIDQ1771344
Morten Riis, Kim Allan Andersen
Publication date: 21 April 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://edoc.hu-berlin.de/18452/8928
Minimax problems in mathematical programming (90C47) Sensitivity, stability, parametric optimization (90C31) Stochastic programming (90C15)
Related Items (11)
Stochastic network models for logistics planning in disaster relief ⋮ Stochastic Decomposition Method for Two-Stage Distributionally Robust Linear Optimization ⋮ An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems ⋮ Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs ⋮ Robust two-stage stochastic linear optimization with risk aversion ⋮ Stability and Continuity in Robust Optimization ⋮ Convergence Analysis for Distributionally Robust Optimization and Equilibrium Problems ⋮ Quantitative Stability Analysis for Distributionally Robust Optimization with Moment Constraints ⋮ Distributionally robust optimization. A review on theory and applications ⋮ Uncertainties in minimax stochastic programs ⋮ Asymptotic behavior of solutions: an application to stochastic NLP
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- A multicut algorithm for two-stage stochastic linear programs
- Distribution sensitivity in stochastic programming
- Stability analysis for stochastic programs
- An upper bound for SLP using first and total second moments
- Bounding separable recourse functions with limited distribution information
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- Dual decomposition in stochastic integer programming
- Quantitative stability in stochastic programming
- Applying the minimum risk criterion in stochastic recourse programs
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- On structure and stability in stochastic programs with random technology matrix and complete integer recourse
- Algorithms for the solution of stochastic dynamic minimax problems
- Stability and sensitivity-analysis for stochastic programming
- On set-valued metric projections, Hahn-Banach extension maps, and spherical image maps
- Stability in stochastic programming with recourse-estimated parameters
- Continuity Properties of Expectation Functions in Stochastic Integer Programming
- Stability of Solutions for Stochastic Programs with Complete Recourse
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Stochastic Optimization Problems with Incomplete Information on Distribution Functions
- Distribution sensitivity analysis for stochastic programs with complete recourse
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem
- Local epi-continuity and local optimization
- Stochastic programming with incomplete information:a surrey of results on postoptimization and sensitivity analysis
- Stability in Two-Stage Stochastic Programming
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Introduction to Stochastic Programming
- Minimax analysis of stochastic problems
- Rates of Convergence in Stochastic Programs with Complete Integer Recourse
- The minimax approach to stochastic programming and an illustrative application
- Extreme Points of Certain Sets of Probability Measures, with Applications
- A scenario aggregation algorithm for the solution of stochastic dynamic minimax problems
- The General Moment Problem, A Geometric Approach
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
This page was built for publication: Applying the minimax criterion in stochastic recourse programs
