Countable-State, Continuous-Time Dynamic Programming with Structure
From MaRDI portal
Publication:4124636
DOI10.1287/OPRE.24.3.477zbMATH Open0353.90092OpenAlexW1976165120MaRDI QIDQ4124636FDOQ4124636
Authors: Steven A. Lippman
Publication date: 1976
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.24.3.477
Queueing theory (aspects of probability theory) (60K25) Hamilton-Jacobi theories (49L99) Markov and semi-Markov decision processes (90C40) Mathematical programming (90C99)
Cited In (4)
- Optimal dynamic pricing for used products in remanufacturing over an infinite horizon
- Numerical analysis of continuous time Markov decision processes over finite horizons
- Optimal decisions for continuous time Markov decision processes over finite planning horizons
- Optimal dynamic pricing of perishable products with stochastic demand and a finite set of prices
This page was built for publication: Countable-State, Continuous-Time Dynamic Programming with Structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124636)