Inventory and Assortment Optimization under General Choice: A Unified Approximation Framework
Abstract
We study joint inventory and assortment optimization under general substitutable choice models. Before a selling horizon, a decision maker chooses initial inventories subject to a capacity constraint on total units stocked, and customers then arrive sequentially and choose among the offered products. We consider two settings, show-all inventory selection, in which every in-stock product must be offered, and dynamic assortment personalization, in which the decision maker observes each customer's type and may adapt the offered assortment to remaining inventory and purchase history. We develop a unified framework linking each setting to a static optimization problem. For show-all inventory selection, a polynomial-time α-approximation for cardinality-constrained static assortment optimization yields guarantees of 0.486α under deterministic or Poisson arrivals and 0.4328α under increasing-failure-rate (IFR) arrivals. For personalization, the same guarantees hold when α is the approximation factor for the joint assortment and customization problem of El Housni and Topaloglu. Our approach combines a fluid relaxation, demand-dependent fractional inventory allocations, bounds on expected truncated demand, and dependent rounding. Notably, our personalized policy fixes one assortment per customer type before the horizon and then offers every in-stock product within it, so it requires no dynamic re-optimization despite competing against the optimal fully adaptive policy. Finally, we construct instances in which optimal show-all revenue approaches only one-half of the fluid bound under deterministic arrivals and 1−w≈0.4328567 under IFR arrivals, where wew=1. With an exact static assortment oracle, our IFR guarantee approaches the latter factor arbitrarily closely.
Related
- A Unified Framework for Assortment Optimization and Matching under MNL Choice
- AI-Mediation in Retail Markets: Revenue Effects and Assortment Optimization
- Assortment optimization under the perception-adjusted Luce model
- The Value of Experiments in Assortment Optimization
- Towards Optimal Inventory Control under Censored Demand: A Biased Sample-Average Approximation Approach
BibTeX
@misc{feldman2026inventory,
title = {{Inventory and Assortment Optimization under General Choice: A Unified Approximation Framework}},
author = {Jacob Feldman and Heng Zhang and Yukai Huang},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.05708},
eprint = {2611.05708},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.05708},
}
RIS
TY - UNPB
TI - Inventory and Assortment Optimization under General Choice: A Unified Approximation Framework
AU - Jacob Feldman
AU - Heng Zhang
AU - Yukai Huang
PY - 2026
DA - 2026/11/03
PB - arXiv
DO - 10.48550/arxiv.2611.05708
UR - https://arxiv.org/abs/2611.05708
AB - We study joint inventory and assortment optimization under general substitutable choice models. Before a selling horizon, a decision maker chooses initial inventories subject to a capacity constraint on total units stocked, and customers then arrive sequentially and choose among the offered products. We consider two settings, show-all inventory selection, in which every in-stock product must be offered, and dynamic assortment personalization, in which the decision maker observes each customer's type and may adapt the offered assortment to remaining inventory and purchase history. We develop a unified framework linking each setting to a static optimization problem. For show-all inventory selection, a polynomial-time α-approximation for cardinality-constrained static assortment optimization yields guarantees of 0.486α under deterministic or Poisson arrivals and 0.4328α under increasing-failure-rate (IFR) arrivals. For personalization, the same guarantees hold when α is the approximation factor for the joint assortment and customization problem of El Housni and Topaloglu. Our approach combines a fluid relaxation, demand-dependent fractional inventory allocations, bounds on expected truncated demand, and dependent rounding. Notably, our personalized policy fixes one assortment per customer type before the horizon and then offers every in-stock product within it, so it requires no dynamic re-optimization despite competing against the optimal fully adaptive policy. Finally, we construct instances in which optimal show-all revenue approaches only one-half of the fluid bound under deterministic arrivals and 1−w≈0.4328567 under IFR arrivals, where we^w=1. With an exact static assortment oracle, our IFR guarantee approaches the latter factor arbitrarily closely.
ER -