๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Sublinear upper bounds for stochastic programs with recourse

โœ Scribed by John R. Birge; Roger J. -B. Wets

Publisher
Springer-Verlag
Year
1989
Tongue
English
Weight
877 KB
Volume
43
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Solving stochastic programs with network
Solving stochastic programs with network recourse
โœ Stein W. Wallace ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 997 KB

In this paper we provide computational procedures for solving stochastic programs with network recourse. Special attention is paid to the feasibility problem, and we show how to solve the recourse or second stage problem. This problem is how to solve a large number of networks where the only differe

SPAR: stochastic programming with advers
SPAR: stochastic programming with adversarial recourse
โœ Matthew D. Bailey; Steven M. Shechter; Andrew J. Schaefer ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 189 KB

We consider a general adversarial stochastic optimization model. Our model involves the design of a system that an adversary may subsequently attempt to destroy or degrade. We introduce SPAR, which utilizes mixed-integer programming for the design decision and a Markov decision process (MDP) for the