An application of Lemke's method to a class of Markov decision problems
From MaRDI portal
Recommendations
- On Lemke processibility of LCP formulations for solving discounted switching control stochastic games
- scientific article; zbMATH DE number 432996
- Survey of linear programming for standard and nonstandard Markovian control problems. Part II: Applications
- scientific article; zbMATH DE number 579399
- Linear programming with multiple choice constraints for single chain undiscounted Markov decision problems
Cites work
- An Analysis of Stochastic Shortest Path Problems
- Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
- scientific article; zbMATH DE number 4061056 (Why is no real title available?)
- scientific article; zbMATH DE number 194298 (Why is no real title available?)
- scientific article; zbMATH DE number 3332061 (Why is no real title available?)
- scientific article; zbMATH DE number 3332062 (Why is no real title available?)
- OPTIMAL STOPPING PROBLEM WITH SEVERAL SEARCH AREAS
Cited in
(3)
This page was built for publication: An application of Lemke's method to a class of Markov decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1610179)