 Inventory allocation with full downward substitution and monotone cost differencesYulia Tseytlin and H. Sebastian Heese European Journal of Operational Research, 2023, vol. 307, issue 1, 130-139 Abstract: We study a single-period multi-product inventory allocation problem with full downward substitution and monotone cost differences. The cost structure with monotone differences is more general than the additive cost structure usually assumed in literature. Using the notion of Monge sequences, we identify conditions under which the problem can be solved efficiently using greedy allocation. For problems that do not meet these conditions, we develop an efficient algorithm that solves the problem to optimality. For this specific problem, our algorithm has substantially lower computational complexity than existing efficient algorithms for the more general transportation problem; we numerically confirm this superior computational efficiency and illustrate the importance of using efficient algorithms at the allocation stage of the inventory management problem. Keywords: Inventory; Substitution; Monge sequences; Algorithms; Transportation problem (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:307:y:2023:i:1:p:130-139 DOI: 10.1016/j.ejor.2022.08.027 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 |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.