Information Relaxation Bounds for Infinite Horizon Markov Decision Processes

DOI10.1287/opre.2017.1631zbMath1384.90117OpenAlexW2739765463MaRDI QIDQ4598650

David B. Brown, Martin B. Haugh

Publication date: 15 December 2017

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4148245bdc9ddf33078b2d0a4c26d82b1a807532

zbMATH Keywords

inventory controlmulticlass queuesLagrangian relaxationsinformation relaxationsinfinite horizon dynamic programs

Mathematics Subject Classification ID

Stochastic programming (90C15) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items (5)

A novel decomposition-based method for solving general-product structure assemble-to-order systems ⋮ Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees ⋮ Asymptotically Optimal Appointment Schedules ⋮ Approximations to Stochastic Dynamic Programs via Information Relaxation Duality ⋮ Pathwise Dynamic Programming

This page was built for publication: Information Relaxation Bounds for Infinite Horizon Markov Decision Processes