Sensitivity analysis in discrete dynamic programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3987072
- Sensitivity analysis in discounted Markovian decision problems
- Sensitivity analysis in a class of dynamic optimization models
- Sensitivity analysis for discrete optimal control problems
- Sensitivity analysis in Markov decision processes with uncertain reward parameters
Cites work
- scientific article; zbMATH DE number 3634009 (Why is no real title available?)
- A New Optimality Criterion for Nonhomogeneous Markov Decision Processes
- Discounting, Ergodicity and Convergence for Markov Decision Processes
- Non-negative matrices and Markov chains. 2nd ed
- Scheduling to Minimize Interaction Cost
- Technical Note—Identifying Forecast Horizons in Nonhomogeneous Markov Decision Processes
- The Tolerance Approach to Sensitivity Analysis in Linear Programming
Cited in
(6)- Sensitivity analysis in a class of dynamic optimization models
- Sensitivity analysis of a sequential decision problem with learning
- Exponential decay in the sensitivity analysis of nonlinear dynamic programming
- scientific article; zbMATH DE number 3987072 (Why is no real title available?)
- Multiaction maintenance subject to action-dependent risk and stochastic failure
- Sensitivity analysis in Markov decision processes with uncertain reward parameters
This page was built for publication: Sensitivity analysis in discrete dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090253)