A Min-Max-Max-Min Approach to Solving a Stochastic Programming Problem with Simple Recourse
Year of publication: |
1992
|
---|---|
Authors: | White, D. J. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 38.1992, 4, p. 540-554
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | stochastic programming | algorithm | saddle point |
-
The online saddle point problem and online convex optimization with knapsacks
Rivera Cardoso, Adrian, (2025)
-
Solving optimization problems with Blackwell approachability
Grand-Clément, Julien, (2024)
-
Adaptive two-stage stochastic programming with an analysis on capacity expansion planning problem
Basciftci, Beste, (2024)
- More ...
-
Infinite horizon Markov decision processes with unknown or variable discount factors
White, Douglas J., (1987)
-
A superharmonic approach to solving infinite horizon partially observable Markov decision problems
White, Douglas J., (1995)
-
A min-max-max-min approach to solving a stochastic programming problem with simple recourse
White, Douglas J., (1992)
- More ...