We extend earlier work on scenario reduction by relying directly on Fortet–Mourier metrics instead of using upper bounds given in terms of mass transportation problems. The impo...
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
—Multistage stochastic programs are effective for solving long-term planning problems under uncertainty. Such programs are usually based on scenario generation model about future...
This paper examines a problem related to the optimal risk management of banks in a stochastic dynamic setting. In particular, we minimize7 market and capital adequacy risk that in...