Optimal steady states, excessive functions, and deterministic dynamic programs
From MaRDI portal
The paper deals with the undiscounted, deterministic, stationary dynamic programming model with state and action spaces being subsets of Euclidean spaces, bounded cost function, and infinite planning horizon. The author defines optimal steady states and discusses the relationship between them and Lagrangian saddle-points. Then he introduces excessive functions and characterizes by means of them optimal steady states.
Recommendations
- scientific article; zbMATH DE number 3860907
- Computing efficient steady state policies for deterministic dynamic programs. I
- Finite state dynamic programming with the total reward criterion
- Dynamic optimization. Deterministic and stochastic models
- Average Optimality in Dynamic Programming with General State Space
Cites work
- A Dynamic Programming Model of Fractional Flows with Application to Maintenance and Replacement Problems
- An Algorithm for a Dynamic Programming Model of Fractional Flows
- scientific article; zbMATH DE number 3720709 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- scientific article; zbMATH DE number 3378671 (Why is no real title available?)
- On optimality criteria for dynamic programs with long finite horizons
- Steady State Policies for Deterministic Dynamic Programs
Cited in
(4)
This page was built for publication: Optimal steady states, excessive functions, and deterministic dynamic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912004)