On fractional flow models and equivalent finite state processes
From MaRDI portal
(Redirected from Publication:1106740)
The relations between a dynamic programming model of fractional flows in an n-sector system and certain finite-state processes are considered. Under certain conditions, the flow model is ``equivalent to an n-state Markov decision process, allowing for simpler computation. Where ``equivalence fails, a partial solution to the flow model follows from the solution to an (n\(+1)\)-state semi-Markov decision process.
Recommendations
- A Dynamic Programming Model of Fractional Flows with Application to Maintenance and Replacement Problems
- An Algorithm for a Dynamic Programming Model of Fractional Flows
- Computing efficient steady state policies for deterministic dynamic programs. II
- Finite state approximation algorithms for average cost denumerable state Markov decision processes
- scientific article; zbMATH DE number 3970555
Cites work
- A Dynamic Programming Model of Fractional Flows with Application to Maintenance and Replacement Problems
- Affine Structure and Invariant Policies for Dynamic Programs
- An Algorithm for a Dynamic Programming Model of Fractional Flows
- Analytical solution of A dynamic transaction flow problem
- Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
- scientific article; zbMATH DE number 3438176 (Why is no real title available?)
- scientific article; zbMATH DE number 3338194 (Why is no real title available?)
- On optimality criteria for dynamic programs with long finite horizons
- Optimal Control of a Graded Manpower System
- Optimization of Multitype Branching Processes
Cited in
(3)
This page was built for publication: On fractional flow models and equivalent finite state processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106740)