arXiv:2602. 05799v2 Announce Type: replace-cross Abstract: We study non-stationary single-item, periodic-review inventory control problems in which the demand distribution is unknown and may change over time.
By Nele H. Amiri, Sean R. Sinclair, Maximiliano Udenio
arXiv:2606. 14679v1 Announce Type: new Abstract: Online inventory optimization (OIO) is online convex optimization with physical memory: inventory carryover makes the feasible action set depend on the past.
By Anthony Pineci, Yunzong Xu
arXiv:2609. 28263v1 Announce Type: new Abstract: The growth of large language model (LLM) inference and search services increases the scale of online linear programming problems, motivating computationally efficient algorithms.
By Jiameng Lyu
arXiv:2609.06083v1 Announce Type: new
Abstract: To make optimal joint pricing and inventory control decisions is a critical challenge for modern retailers. In practice, retailers face changing market...
By Zean Han, Zezhen Ding, Jiheng Zhang
arXiv:2608. 02343v1 Announce Type: cross Abstract: Many operational problems are constrained sequential decision processes with large, combinatorial action spaces and interdependent feasibility constraints.
By Patrick Helm, Jan-Niklas Doerr, Joren Gijsbrechts, Stefan Minner
The paper presents a data‑driven framework for multi‑period lost‑sales inventory control when demand is censored, meaning stockouts only reveal that demand exceeded the stocking level. It introduces a new cost decomposition for base‑stock policies and a biased sample‑average approximation (SAA) method, leading to two algorithms: an upper‑biased SAA that achieves near‑optimal sample complexity under an offline coverage condition, and a lower‑biased SAA that actively generates coverage to achieve near‑optimal online regret. The biased SAA approach offers a general principle for applying pessimism and optimism in settings with censored feedback.
By Yuxuan Han, Xiaoyu Fan, Jiawei Zhang, Zhengyuan Zhou
arXiv:2608.30944v1 Announce Type: new
Abstract: In online retailing, when a product sells out, a retailer often sees only the units sold, not how many customers would have bought it had inventory bee...
By Zean Han, Jing Liang, Ruihan Lin, Zezhen Ding, Jiheng Zhang
arXiv:2501. 18049v3 Announce Type: replace Abstract: We study online learning for a seller that jointly chooses per-period inventory positions and a uniform price, then fulfills realized demand through a downstream allocation.
By Jianyu Xu, Xuan Wang, Yu-Xiang Wang, Jiashuo Jiang
arXiv:2609.05895v1 Announce Type: new
Abstract: We study a finite-horizon online resource allocation problem with initial resource capacities proportional to the horizon. In each period, a request ty...
By Menglong Li, Jiawei Zhang
arXiv:2606. 06201v1 Announce Type: new Abstract: Pharmaceutical supply chains (PSCs) struggle with inventory management (IM) due to unpredictable demand patterns and variable lead times associated with restocking.
By Amandeep Kaur, Gyan Prakash
arXiv:2607. 23434v1 Announce Type: cross Abstract: Unexpected shocks recur in global operations, requiring decision rules that adapt as market and operating conditions change.
By Young Hyun Cho, Franz Stoll, Will Wei Sun, Guang Lin, Stephan Biller
arXiv:2609.00710v1 Announce Type: cross
Abstract: An LLM application often sells or internally allocates several service products: a small or premium model, a short or long token cap, and possibly mu...
By Patrick Wong