Multiproduct Inventory Systems with Upgrading: Replenishment, Allocation, and Online Learning

References

• Agrawal S, Jia R (2022) Learning in structured MDPs with convex cost functions: Improved regret bounds for inventory management. Oper. Res. 70(3):1646–1664.Link, Google Scholar
• Baccara M, Lee S, Yariv L (2020) Optimal dynamic matching. Theoret. Econom. 15(3):1221–1278.Crossref, Google Scholar
• Bassok Y, Anupindi R, Akella R (1999) Single-period multiproduct inventory models with substitution. Oper. Res. 47(4):632–642.Link, Google Scholar
• Chen J (1997) Substitution and inspection models in production-inventory systems. PhD thesis, Columbia University, New York.Google Scholar
• Chen B, Chao X (2020) Dynamic inventory control with stockout substitution and demand learning. Management Sci. 66(11):5108–5127.Link, Google Scholar
• Chen B, Shi C (2025) Tailored base-surge policies in dual-sourcing inventory systems with demand learning. Oper. Res. 73(4):1723–1743.Link, Google Scholar
• Chen B, Chao X, Ahn HS (2019) Coordinating pricing and inventory replenishment with nonparametric demand learning. Oper. Res. 67(4):1035–1052.Abstract, Google Scholar
• Chen B, Chao X, Shi C (2021) Nonparametric learning algorithms for joint pricing and inventory control with lost sales and censored demand. Math. Oper. Res. 46(2):726–756.Link, Google Scholar
• Chen W, Shi C, Duenyas I (2020) Optimal learning algorithms for stochastic inventory systems with random capacities. Production Oper. Management 29(7):1624–1649.Crossref, Google Scholar
• Chen B, Wang Y, Zhou Y (2024) Optimal policies for dynamic pricing and inventory control with nonparametric censored demands. Management Sci. 70(5):3362–3380.Link, Google Scholar
• Chen B, Simchi-Levi D, Wang Y, Zhou Y (2022) Dynamic pricing and inventory control with fixed ordering cost and incomplete demand information. Management Sci. 68(8):5684–5703.Link, Google Scholar
• Chen L, Kyng R, Liu Y, Peng R, Probst Gutenberg M, Sachdeva S (2025) Maximum flow and minimum-cost flow in almost-linear time. J. ACM 72(3):1–103.Crossref, Google Scholar
• Cormen TH, Leiserson CE, Rivest RL, Stein C (2022) Introduction to Algorithms (MIT Press, Cambridge, MA).Google Scholar
• den Boer AV, Chen B, Wang Y (2024) Pricing and positioning of horizontally differentiated products with incomplete demand information. Oper. Res. 72(6):2446–2466.Link, Google Scholar
• Duenyas I, Tsai C (2000) Control of a manufacturing system with random product yield and downward substitutability. IIE Trans. 32(9):785–795.Crossref, Google Scholar
• Elmachtoub AN, Yao D, Zhou Y (2019) The value of flexibility from opaque selling. Preprint, submitted November 19, https://doi.org/10.2139/ssrn.3483872.Google Scholar
• Estes AS, Ball MO (2021) Monge properties, optimal greedy policies, and policy improvement for the dynamic stochastic transportation problem. INFORMS J. Comput. 33(2):785–807.Abstract, Google Scholar
• Feng Q, Lu LX (2010) Design outsourcing in a differentiated product market: The role of bargaining and scope economies. Preprint, submitted September 13, https://doi.org/10.2139/ssrn.2986185.Google Scholar
• Feng Q, Li C, Lu M, Shanthikumar JG (2022) Dynamic substitution for selling multiple products under supply and demand uncertainties. Production Oper. Management 31(4):1645–1662.Crossref, Google Scholar
• Flaxman AD, Kalai AT, McMahan HB (2005) Online convex optimization in the bandit setting: Gradient descent without a gradient. Buchsbaum A, ed. Proc. 16th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 385–394.Google Scholar
• Gallego G, Katircioglu K, Ramachandran B (2006) Semiconductor inventory management with multiple grade parts and downgrading. Production Planning Control 17(7):689–700.Crossref, Google Scholar
• Glasserman P (1990) Gradient Estimation via Perturbation Analysis (Springer, New York).Google Scholar
• Godfrey GA, Powell WB (2001) An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Sci. 47(8):1101–1112.Link, Google Scholar
• Gong XY, Simchi-Levi D (2024) Bandits atop reinforcement learning: Tackling online inventory models with cyclic demands. Management Sci. 70(9):6139–6157.Abstract, Google Scholar
• Hu M, Zhou Y (2022) Dynamic type matching. Manufacturing Service Oper. Management 24(1):125–142.Link, Google Scholar
• Hu X, Duenyas I, Kapuscinski R (2008) Optimal joint inventory and transshipment control under uncertain capacity. Oper. Res. 56(4):881–897.Link, Google Scholar
• Huh WT, Janakiraman G, Muckstadt J, Rusmevichientong P (2009) An adaptive algorithm for finding the optimal base-stock policy in lost sales inventory systems with censored demand. Math. Oper. Res. 34(2):397–416.Link, Google Scholar
• Huh WT, Levi R, Rusmevichientong P, Orlin JB (2011) Adaptive data-driven inventory control with censored demand based on Kaplan-Meier estimator. Oper. Res. 59(4):929–941.Link, Google Scholar
• Jain A, Moinzadeh K, Dumrongsiri A (2015) Priority allocation in a rental model with decreasing demand. Manufacturing Service Oper. Management 17(2):236–248.Link, Google Scholar
• Kahn AB (1962) Topological sorting of large networks. Comm. ACM 5(11):558–562.Crossref, Google Scholar
• Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Levi R, Perakis G, Uichanco J (2015) The data-driven newsvendor problem: New bounds and insights. Oper. Res. 63(6):1294–1306.Link, Google Scholar
• Levi R, Roundy RO, Shmoys DB (2007) Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. 32(4):821–839.Link, Google Scholar
• Lyu C, Zhang H, Xin L (2024) UCB-type learning algorithms with Kaplan–Meier estimator for lost-sales inventory models with lead times. Oper. Res. 72(4):1317–1332.Link, Google Scholar
• Mahajan S, van Ryzin G (2001) Stocking retail assortments under dynamic consumer substitution. Oper. Res. 49(3):334–351.Link, Google Scholar
• Mao W, Zhang K, Zhu R, Simchi-Levi D, Başar T (2025) Model-free nonstationary reinforcement learning: Near-optimal regret and applications in multiagent reinforcement learning and inventory control. Management Sci. 71(2):1564–1580.Link, Google Scholar
• Nagarajan M, Rajagopalan S (2008) Inventory models for substitutable products: Optimal policies and heuristics. Management Sci. 54(8):1453–1466.Link, Google Scholar
• Parker RP, Olsen TL (2010) Dynamic inventory competition with stockout-based substitution. Dror M, Sosic G, eds. Proc. 2010 Conf. Behav. Quant. Game Theory: Conf. Future Directions (Association for Computing Machinery, New York), 1–31.Google Scholar
• Pasternack BA, Drezner Z (1991) Optimal inventory policies for substitutable commodities with stochastic demand. Naval Res. Logist. 38(2):221–240.Crossref, Google Scholar
• Powell W, Ruszczyński A, Topaloglu H (2004) Learning algorithms for separable approximations of discrete stochastic optimization problems. Math. Oper. Res. 29(4):814–836.Link, Google Scholar
• Rao U, Swaminathan J, Zhang J (2004) Multi-product inventory planning with downward substitution, stochastic demand and setup costs. IIE Trans. 36(1):59–71.Crossref, Google Scholar
• Schlapp J, Fleischmann M (2018) Multiproduct inventory management under customer substitution and capacity restrictions. Oper. Res. 66(3):740–747.Link, Google Scholar
• Shamir R, Dietrich BL (1990) Characterization and algorithms for greedily solvable transportation problems. Johnson DS, ed. Proc. First Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 358–366.Google Scholar
• Shi C, Chen W, Duenyas I (2016) Nonparametric data-driven algorithms for multiproduct inventory systems with censored demand. Oper. Res. 64(2):362–370.Link, Google Scholar
• Shumsky RA, Zhang F (2009) Dynamic capacity management with substitution. Oper. Res. 57(3):671–684.Link, Google Scholar
• Tang J, Chen B, Shi C (2024) Online learning for dual-index policies in dual-sourcing systems. Manufacturing Service Oper. Management 26(2):758–774.Link, Google Scholar
• Wang Y (2025) On adaptivity in nonstationary stochastic optimization with bandit feedback. Oper. Res. 73(2):819–828.Link, Google Scholar
• Xu H, Yao DD, Zheng S (2011) Optimal control of replenishment and substitution in an inventory system with nonstationary batch demand. Production Oper. Management 20(5):727–736.Crossref, Google Scholar
• Yu Y, Chen X, Zhang F (2015) Dynamic capacity management with general upgrading. Oper. Res. 63(6):1372–1389.Link, Google Scholar
• Yuan H, Luo Q, Shi C (2021) Marrying stochastic gradient descent with bandits: Learning algorithms for inventory systems with fixed costs. Management Sci. 67(10):6089–6115.Link, Google Scholar
• Zhang H, Chao X, Shi C (2018) Perishable inventory systems: Convexity results for base-stock policies and learning algorithms under censored demand. Oper. Res. 66(5):1276–1286.Link, Google Scholar
• Zhang H, Chao X, Shi C (2020) Closing the gap: A learning algorithm for lost-sales inventory systems with lead times. Management Sci. 66(5):1962–1980.Link, Google Scholar
• Zhao Y, Wang X, Xin L (2025) Multi-item online order fulfillment in a two-layer network. Oper. Res. 73(5):2297–2305.Link, Google Scholar