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 adversarial recourse
β Scribed by Matthew D. Bailey; Steven M. Shechter; Andrew J. Schaefer
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 189 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
β¦ Synopsis
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 modeling of our adversarial phase.
π SIMILAR VOLUMES
We apply the techniques of response surface methodology (RSM) to approximate the objective function of a two-stage stochastic linear program with recourse. In particular, the objective function is estimated, in the region of optimality, by a quadratic function of the firststage decision variables. T