Computing efficient steady state policies for deterministic dynamic programs. II

DOI10.1006/JMAA.1993.1244MaRDI QIDQ1260897zbMATH OpenOpenAlexFDO

Authors James Flynn

Publication date 5 September 1993

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jmaa.1993.1244

zbMATH Keywords

efficient computationopportunity costfractional flow modelsteady state policy

Mathematics Subject Classification ID

Dynamic programming (90C39) Production models (90B30)

Recommendations

• Computing efficient steady state policies for deterministic dynamic programs. I
• scientific article; zbMATH DE number 53073
• An Algorithm for a Dynamic Programming Model of Fractional Flows
• Computing average optimal constrained policies in stochastic dynamic programming.
• On fractional flow models and equivalent finite state processes

Cited in

(5)

• An Algorithm for a Dynamic Programming Model of Fractional Flows
• Computing efficient steady state policies for deterministic dynamic programs. I
• A Dynamic Programming Model of Fractional Flows with Application to Maintenance and Replacement Problems
• Stabilizing policy improvement for large-scale infinite-horizon dynamic programming
• On fractional flow models and equivalent finite state processes

This page was built for publication: Computing efficient steady state policies for deterministic dynamic programs. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1260897)