Input optimization for infinite-horizon discounted programs
Let V(x) denote the optimal (maximal) value of a discrete time dynamic program, given the initial state x. This paper is concerned with the inverse correspondence \(V^{-1}\) and its infimum \[ I(v)\quad:=\quad \inf _{x}\{x: V(x)\geq v\} \] for discounted, infinite-horizon programs with one-dimensional state space and monotone V(\(\cdot)\). The function I(v), interpreted as the optimal (minimal) input required to achieve v, is computed using dynamic programming recursion (Theorem 3.1) or value iteration (Theorem 3.2). An application to mathematical economics (optimal consumption plan) is given.
- Optimal Programs on Infinite Horizon 1
- Infinite-horizon deterministic dynamic programming in discrete time: a monotone convergence principle and a penalty method
- Discounted dynamic programming with unbounded returns: application to economic models
- Some structured dynamic programs arising in economics
- Infinite horizon programs; convergence of approximate solutions
- Approximation Algorithms for Certain Scheduling Problems
- Existence Results and Finite Horizon Approximates for Infinite Horizon Optimization Problems
- scientific article; zbMATH DE number 3860834 (Why is no real title available?)
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 3720707 (Why is no real title available?)
- scientific article; zbMATH DE number 3628142 (Why is no real title available?)
- scientific article; zbMATH DE number 3893867 (Why is no real title available?)
- scientific article; zbMATH DE number 3198484 (Why is no real title available?)
- Inverse theorem in dynamic programming. I
- Nonlinear functional analysis and optimal economic growth
This page was built for publication: Input optimization for infinite-horizon discounted programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102875)