The optimization of K-effect models by linear and dynamic programming
From MaRDI portal
Cites work
- A dynamic programming algorithm for embedded Markov chains when the planning horizon is at infinity
- Composition Principles for Synthesis of Optimal Multistage Processes
- Discrete Dynamic Programming
- Ergodic theory for discrete semi-Markov chains
- scientific article; zbMATH DE number 3128787 (Why is no real title available?)
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- Linear programming and sequential decisions
- Linear Programming in a Markov Chain
- Markov Renewal Processes with Finitely Many States
- Markov-Renewal Programming. I: Formulation, Finite Return Models
- On a Quasi-Linear Equation
- On Nonterminating Stochastic Games
- On sequential decisions and Markov chains
- On the optimality of pure strategies
- On the Theory of Dynamic Programming
- Some Functional Equations in the Theory of Dynamic Programming. I. Functions of Points and Point Transformations
- Stochastic Games
Cited in
(1)
This page was built for publication: The optimization of K-effect models by linear and dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2525501)