Fixed-dimensional stochastic dynamic programs: an approximation scheme and an inventory application
From MaRDI portal
Recommendations
- Fully polynomial time (,)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
- A computationally efficient FPTAS for convex stochastic dynamic programs
- A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
- Fully polynomial time approximation schemes for stochastic dynamic programs
- Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states
Cited in
(12)- Approximating convex functions via non-convex oracles under the relative noise model
- Fully polynomial time (,)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
- MIDAS: a mixed integer dynamic approximation scheme
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty
- Dynamic programming on the probabilistic inventory problems with multiple piecewise cost functions
- Optimality gap of constant-order policies decays exponentially in the lead time for lost sales models
- Asymptotic optimality of constant-order policies for lost sales inventory models with large lead times
- Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states
- scientific article; zbMATH DE number 6133034 (Why is no real title available?)
- A computationally efficient FPTAS for convex stochastic dynamic programs
- Dynamic programming in inventory management: a review
- Deep controlled learning for inventory control
This page was built for publication: Fixed-dimensional stochastic dynamic programs: an approximation scheme and an inventory application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166300)