Applying the minimax criterion in stochastic recourse programs
type: Item
instance of: scholarly article
title: Applying the minimax criterion in stochastic recourse programs
zbMATH Open document ID: 1062.90043
author: Morten Riis
author: Kim Allan Andersen
published in: European Journal of Operational Research
publication date: 2005-04-21T00:00:00Z
full work available at URL: http://edoc.hu-berlin.de/18452/8928
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 2159747
zbMATH Keywords: Stochastic programming
zbMATH Keywords: Minimax techniques
zbMATH Keywords: Stability
zbMATH Keywords: Algorithms
MaRDI profile type: Publication
OpenAlex ID: W1978787448
cites work: A finite branch-and-bound algorithm for two-stage stochastic integer programs
cites work: Q5560061
cites work: Bounding separable recourse functions with limited distribution information
cites work: A multicut algorithm for two-stage stochastic linear programs
cites work: Introduction to Stochastic Programming
cites work: Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem
cites work: Algorithms for the solution of stochastic dynamic minimax problems
cites work: A scenario aggregation algorithm for the solution of stochastic dynamic minimax problems
cites work: Dual decomposition in stochastic integer programming
cites work: On set-valued metric projections, Hahn-Banach extension maps, and spherical image maps
cites work: Stability in stochastic programming with recourse-estimated parameters
cites work: The minimax approach to stochastic programming and an illustrative application
cites work: Stochastic programming with incomplete information:a surrey of results on postoptimization and sensitivity analysis
cites work: Stability and sensitivity-analysis for stochastic programming
cites work: Q4395398
cites work: Stochastic Optimization Problems with Incomplete Information on Distribution Functions
cites work: Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
cites work: Q3777801
cites work: An upper bound for SLP using first and total second moments
cites work: Q4309474
cites work: Extreme Points of Certain Sets of Probability Measures, with Applications
cites work: The General Moment Problem, A Geometric Approach
cites work: Q3777818
cites work: Q5541833
cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Q4838490
cites work: Applying the minimum risk criterion in stochastic recourse programs
cites work: Local epi-continuity and local optimization
cites work: Stability in Two-Stage Stochastic Programming
cites work: Q5638112
cites work: Scenarios and Policy Aggregation in Optimization Under Uncertainty
cites work: Distribution sensitivity in stochastic programming
cites work: Stability analysis for stochastic programs
cites work: Stability of Solutions for Stochastic Programs with Complete Recourse
cites work: A regularized decomposition method for minimizing a sum of polyhedral functions
cites work: Continuity Properties of Expectation Functions in Stochastic Integer Programming
cites work: On structure and stability in stochastic programs with random technology matrix and complete integer recourse
cites work: Rates of Convergence in Stochastic Programs with Complete Integer Recourse
cites work: Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
cites work: Quantitative stability in stochastic programming
cites work: Minimax analysis of stochastic problems
cites work: L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
cites work: Distribution sensitivity analysis for stochastic programs with complete recourse
cites work: Q5543208
DOI: 10.1016/J.EJOR.2003.09.033
description: scientific article; zbMATH DE number 2159747