[(g,w)]-Optima in Markov Renewal Programs.

Bennett L. Fox

Expert InsightsPublished 1967

An extension of RM-5208, [Multichain Markov Renewal Programs], to cover the case of completely ergodic MRPs. Policies that are nearly optimal for small discount rates are found by linear programming. More precisely, the policies are [(g,w)]-optimal, where, for a given policy, [g] is the loss rate and [w] the bias term. Finding [(g,w)]-optima in completely ergodic programs is primarily of theoretical interest, because ordinarily there is a unique policy minimizing [g]. There are examples, however, in which several policies exist that minimize [g], but not all of these are [(g,w)]-optimal. 7 pp. Ref.

Document Details

Citation

Chicago Manual of Style

Fox, Bennett L., [(g,w)]-Optima in Markov Renewal Programs. Santa Monica, CA: RAND Corporation, 1967. https://www.rand.org/pubs/papers/P3624.html.
BibTeX RIS

This publication is part of the RAND paper series. The paper series was a product of RAND from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.