Amortized efficiency of list update and paging rules
Communications of the ACM
Online computation and competitive analysis
Online computation and competitive analysis
Convex Optimization
Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach
Manufacturing & Service Operations Management
A Robust Optimization Approach to Inventory Theory
Operations Research
Online make-to-order joint replenishment model: primal dual competitive algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Revenue Management with Limited Demand Information
Management Science
Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
Mathematics of Operations Research
Regret in the Newsvendor Model with Partial Information
Operations Research
A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand
Mathematics of Operations Research
Mathematics of Operations Research
Toward Robust Revenue Management: Competitive Analysis of Online Booking
Operations Research
Robust Approximation to Multiperiod Inventory Management
Operations Research
Online lot-sizing problems with ordering, holding and shortage costs
Operations Research Letters
| Hi-index | 0.00 |
We study profit maximization in inventory control problems where demands are unknown. Neither probabilistic distributions nor sets are available to characterize the unknown demand parameters. Therefore, we adopt an online optimization perspective for our analysis. The usual competitive ratio is not well defined for the problems we analyze; consequently, we introduce a new worst-case metric that is suitable. We consider two inventory management frameworks: (1) perishable products with lost sales and (2) durable products with backlogged demand. We consider both finite and infinite planning horizons. We design best-possible online procurement strategies for all cases.