Indexed metadata
Markov Renewal Programming by Linear Fractional Programming
Bennett Fox
Source abstract
Markov renewal programming is treated by linear fractional programming. Particular attention is given to the resolution of tied policies that minimize expected cost per unit time. The multichain case is handled by a decomposition approach.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.