We consider sequences-indexed by time (discrete stages)-of families of multistage stochastic optimization problems. At each time, the optimization problems in a family are parameterized by some quantities (initial states, constraint levels.. .). In this framework, we introduce an adapted notion of time consistent optimal solutions, that is, solutions that remain optimal after truncation of the past and that are optimal for any values of the parameters. We link this time consistency notion with the concept of state variable in Markov Decision Processes for a class of multistage stochastic optimization problems incorporating state constraints at the final time, either formulated in expectation or in probability. For such problems, when the pr...
We consider multistage decision processes where criterion function is an expectation of minimum func...
Multistage stochastic programs are regarded as mathematical programs in a Banach space X of summable...
This thesis presents novel methods for computing optimal pre-commitment strategies in time-inconsist...
In this work we study the concept of time consistency as it relates to multistage risk-averse stocha...
Multistage stochastic optimization problems are, by essence, complex as their solutions are indexed...
International audienceFor a sequence of dynamic optimization problems, we aim at discussing a notion...
Multistage stochastic optimization aims at finding optimal decision strategies in situations where t...
Multistage stochastic optimization problems appear in many ways in finance, insurance, energy produc...
Multistage stochastic programs, which involve sequences of decisions over time, are usually hard to ...
Multistage stochastic programs, which involve sequences of decisions over time, are usually hard to ...
This paper considers model uncertainty for multistage stochastic programs. The data and information ...
Dynamic stochastic optimization problems with a large (possibly infinite) number of decision stages ...
Stochastic programming is a mathematical optimization model for decision making when the uncertainty...
Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decis...
This paper considers model uncertainty for multistage stochastic programs. The data and information ...
We consider multistage decision processes where criterion function is an expectation of minimum func...
Multistage stochastic programs are regarded as mathematical programs in a Banach space X of summable...
This thesis presents novel methods for computing optimal pre-commitment strategies in time-inconsist...
In this work we study the concept of time consistency as it relates to multistage risk-averse stocha...
Multistage stochastic optimization problems are, by essence, complex as their solutions are indexed...
International audienceFor a sequence of dynamic optimization problems, we aim at discussing a notion...
Multistage stochastic optimization aims at finding optimal decision strategies in situations where t...
Multistage stochastic optimization problems appear in many ways in finance, insurance, energy produc...
Multistage stochastic programs, which involve sequences of decisions over time, are usually hard to ...
Multistage stochastic programs, which involve sequences of decisions over time, are usually hard to ...
This paper considers model uncertainty for multistage stochastic programs. The data and information ...
Dynamic stochastic optimization problems with a large (possibly infinite) number of decision stages ...
Stochastic programming is a mathematical optimization model for decision making when the uncertainty...
Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decis...
This paper considers model uncertainty for multistage stochastic programs. The data and information ...
We consider multistage decision processes where criterion function is an expectation of minimum func...
Multistage stochastic programs are regarded as mathematical programs in a Banach space X of summable...
This thesis presents novel methods for computing optimal pre-commitment strategies in time-inconsist...