On Linear Programming in a Markov Decision Problem

DOI10.1287/MNSC.16.5.281zbMath0191.48602OpenAlexW2018547763MaRDI QIDQ5585886

Eric V. Denardo

Publication date: 1970

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.16.5.281

zbMATH Keywords

operations research

Related Items (30)

LP based upper and lower bounds for Cesàro and Abel limits of the optimal values in problems of control of stochastic discrete time systems ⋮ Computational aspects in applied stochastic control ⋮ Communicating MDPs: Equivalence and LP properties ⋮ On Linear Programming for Constrained and Unconstrained Average-Cost Markov Decision Processes with Countable Action Spaces and Strictly Unbounded Costs ⋮ Generalized Markovian decision processes ⋮ Survey of linear programming for standard and nonstandard Markovian control problems. Part I: Theory ⋮ Linear programming formulation of MDPs in countable state space: The multichain case ⋮ Derman's book as inspiration: some results on LP for MDPs ⋮ The stochastic shortest path problem: a polyhedral combinatorics perspective ⋮ Perturbation of null spaces with application to the eigenvalue problem and generalized inverses ⋮ State partitioning based linear program for stochastic dynamic programs: an invariance property ⋮ OPTIMAL SWITCHING ON AND OFF THE ENTIRE SERVICE CAPACITY OF A PARALLEL QUEUE ⋮ MF-OMO: An Optimization Formulation of Mean-Field Games ⋮ Optimization of file migration policies in distributed computer systems ⋮ Determining the optimal strategies for discrete control problems on stochastic networks with discounted costs ⋮ Solving stochastic dynamic programming problems by linear programming — An annotated bibliography ⋮ Optimal choice of reward levels in an organization ⋮ Optimal harvesting strategies for stochastic single-species, multiage class models ⋮ Dynamic programming and principles of optimality ⋮ On the Minimum Pair Approach for Average Cost Markov Decision Processes with Countable Discrete Action Spaces and Strictly Unbounded Costs ⋮ Bounds on distances between eigenvalues ⋮ A note on maximal mean/standard deviation ratio in an undiscounted MDP ⋮ A new optimality criterion for discrete dynamic programming ⋮ Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains ⋮ Numerical comparison of controls and verification of optimality for stochastic control problems ⋮ On the block upper-triangularity of undiscounted multi-chain Markov decision problems ⋮ MARKOV DECISION PROCESSES ⋮ Linear programming with multiple choice constraints for single chain undiscounted Markov decision problems ⋮ Mean-variance criteria in an undiscounted Markov decision process ⋮ Weak conditions for average optimality in Markov control processes

This page was built for publication: On Linear Programming in a Markov Decision Problem