.png){kind=icon}
Return
Allocation under a general substitution structure
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2019.02.049.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We develop a novel solution approach for the single-period multi-product inventory allocation problem with general substitution structure. First, we construct an initial allocation sequence and present conditions for existence of a Monge sequence, implying optimality of a greedy solution. We prove that the greedy allocation along the initial sequence is optimal even if no Monge sequence exists, when in the solution all demand is satisfied and all inventory is used. For all other cases, we develop a correction algorithm and prove optimality of the resulting allocation. The worst-case computational complexity of our solution is superior to existing algorithms for the structurally related transportation problem. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Inventory
Substitution
Allocation
Transportation problem
Monge sequences
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveShareSave
View more