Dynamic Programming, Queueing Optimization, and Their Applications.
Abstract
The areas of research include the theoretical development of semi-Markov decision processes (SMDP). In particular, an optimal stationary policy, determined by the usual functional equation, was found in both the discounted and average cost case, when the system described by the SMDP is a queueing reward system with infinite queue capacity. A dynamic queueing optimization problem has been solved in which the decision-maker controls the arrival process by increasing or decreasing the price charged for a facility's service. A new technique in the optimization of exponential queueing systems was developed. An Air Force transportation inventory model concerning the logistics of spare items was developed using a dynamic programming decision rule. Research was also completed in the areas of optimal consumption with a stochastic income stream and optimal reinsurance. (Modified author abstract)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 30, 1973
- Accession Number
- AD0767650
Entities
People
- Steven A. Lippman
Organizations
- University of California, Los Angeles