scientific article; zbMATH DE number 1786114
From MaRDI portal
Publication:4547434
zbMath1004.90063MaRDI QIDQ4547434
Publication date: 19 September 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear programming (90C05) Markov and semi-Markov decision processes (90C40) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (12)
The value iteration algorithm is not strongly polynomial for discounted dynamic programming ⋮ Complexity bounds for approximately solving discounted MDPs by value iterations ⋮ (Approximate) iterated successive approximations algorithm for sequential decision processes ⋮ Optimal strategies in the fighting fantasy gaming system: influencing stochastic dynamics by gambling with limited resource ⋮ Strong polynomiality of policy iterations for average-cost MDPs modeling replacement and maintenance problems ⋮ On polynomial cases of the unichain classification problem for Markov decision processes ⋮ Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming ⋮ Singularly perturbed linear programs and Markov decision processes ⋮ Admission control strategies for tandem Markovian loss systems ⋮ Blackwell optimality in Markov decision processes with partial observation. ⋮ Optimal price-threshold control for battery operation with aging phenomenon: a quasiconvex optimization approach ⋮ Optimal pricing for a \(\mathrm{GI}/\mathrm{M}/k/N\) queue with several customer types and holding costs
This page was built for publication:
