On the decomposition property for a dynamic inventory rationing problem with multiple demand classes and backorder

Lina Bao, Zhiying Liu, Yimin Yu and Wei Zhang

European Journal of Operational Research, 2018, vol. 265, issue 1, 99-106

Abstract: In this paper, we study a dynamic inventory rationing problem of a single item with multiple demand classes and backorder. Demand classes are differentiated by their unit backlogging costs. The corresponding dynamic programming problem is multidimensional and computationally challenging. With a novel state transformation, we find that the optimal policy can be described by a nested base stock policy. In particular, we can decompose the value function as the sum of single-variable convex functions. This property breaks the curse of dimensionality and significantly reduces computational effort in computing optimal policies. Our approach allows us to extend the results to systems with ordering, exogenous supply, priority upgrading.

Keywords: (T) Inventory; Rationing; Multiple demand classes; Decomposability (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221717306483
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:265:y:2018:i:1:p:99-106

DOI: 10.1016/j.ejor.2017.07.021

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().