On Finding the Maximal Gain for Markov Decision Processes
From MaRDI portal
Publication:5576132
DOI10.1287/opre.17.5.857zbMath0184.23202OpenAlexW2152620356MaRDI QIDQ5576132
Publication date: 1969
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.17.5.857
Related Items (29)
Variational characterizations in Markov decision processes ⋮ Computation techniques for large scale undiscounted markov decision processes ⋮ A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks ⋮ Dual bounds on the equilibrium distribution of a finite Markov chain ⋮ A methodology for computation reduction for specially structured large scale Markov decision problems ⋮ Heuristic procedures for a stochastic lot-sizing problem in make-to-order manufacturing ⋮ Axiomatic considerations in multi-objective location theory ⋮ Unnamed Item ⋮ Some basic concepts of numerical treatment of Markov decision models ⋮ Nonstationary Markov decision problems with converging parameters ⋮ Approximate solutions for a stochastic lot-sizing problem with partial customer-order information ⋮ The method of value oriented successive approximations for the average reward Markov decision process ⋮ Turnpikes in Finite Markov Decision Processes and Random Walk ⋮ An iterative method for approximating average cost optimal (s,S) inventory policies ⋮ Blood platelet production: optimization by dynamic programming and simulation ⋮ On air traffic flow management with rerouting. I: Deterministic case ⋮ A value iteration method for undiscounted multichain Markov decision processes ⋮ A multi-period TSP with stochastic regular and urgent demands ⋮ Computationally efficient algorithms for on-line optimization of Markov decision processes ⋮ Markov decision processes ⋮ A successive approximation algorithm for an undiscounted Markov decision process ⋮ On the total reward variance for continuous-time Markov reward chains ⋮ Contraction mappings underlying undiscounted Markov decision problems ⋮ Markov programming with policy constraints ⋮ Production strategies for a stochastic lot-sizing problem with constant capacity ⋮ Iterative solution of the functional equations of undiscounted Markov renewal programming ⋮ Optimal replacement policy for a redundant system ⋮ An error bound concerning Howard's Value Determination Equation ⋮ Zur Extrapolation in Markoffschen Entscheidungsmodellen mit Diskontierung
This page was built for publication: On Finding the Maximal Gain for Markov Decision Processes
