<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
Structural properties of a class of robust inventory and queueing control problems

Loading...
Thumbnail Image

Departments

School / College / Institute

Item type:Organizational Unit,
Item type:Organizational Unit,

Program

Organization Authors

Co-Authors

Date

Language

Embargo Status

NO

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

In standard stochastic dynamic programming, the transition probability distributions of the underlying Markov Chains are assumed to be known with certainty. We focus on the case where the transition probabilities or other input data are uncertain. Robust dynamic programming addresses this problem by defining a min-max game between Nature and the controller. Considering examples from inventory and queueing control, we examine the structure of the optimal policy in such robust dynamic programs when event probabilities are uncertain. We identify the cases where certain monotonicity results still hold and the form of the optimal policy is determined by a threshold. We also investigate the marginal value of time and the case of uncertain rewards.

Source

Publisher

Wiley

Citation

item.page.haspartof

Source

Naval Research Logistics

item.page.ispartofseries

item.page.edition

DOI

10.1002/nav.21748

item.page.datauri

item.page.link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

Related Patent

Related Goal

Google Scholar
Scholar'da Ara ↗
Altmetric
Dimensions
PlumX Metrikleri
BIP! Indicators